Intersection and decomposition algorithms for planar arrangements:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge u.a.
Cambridge Univ. Press
1991
|
| Ausgabe: | 1. publ. |
| Schlagwörter: | |
| Beschreibung: | Literaturverz. S. 259 - 269 |
| Umfang: | XVII, 277 S. graph. Darst. |
| ISBN: | 0521404460 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004664876 | ||
| 003 | DE-604 | ||
| 005 | 20220914 | ||
| 007 | t| | ||
| 008 | 920109s1991 xx d||| |||| 00||| eng d | ||
| 020 | |a 0521404460 |9 0-521-40446-0 | ||
| 035 | |a (OCoLC)231261924 | ||
| 035 | |a (DE-599)BVBBV004664876 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-12 |a DE-384 |a DE-706 |a DE-634 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA167 | |
| 082 | 0 | |a 516/.13 |2 20 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 052d |2 stub | ||
| 084 | |a MAT 510d |2 stub | ||
| 084 | |a DAT 535d |2 stub | ||
| 100 | 1 | |a Agarwal, Pankaj K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Intersection and decomposition algorithms for planar arrangements |c Pankaj K. Agarwal |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge u.a. |b Cambridge Univ. Press |c 1991 | |
| 300 | |a XVII, 277 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 259 - 269 | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 4 | |a Géométrie - Informatique | |
| 650 | 7 | |a Géométrie - Informatique |2 ram | |
| 650 | 4 | |a Géométrie combinatoire | |
| 650 | 7 | |a Géométrie combinatoire |2 ram | |
| 650 | 7 | |a algorithme décomposition |2 inriac | |
| 650 | 7 | |a algorithme intersection |2 inriac | |
| 650 | 7 | |a algorithme partition |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a géométrie algorithmique |2 inriac | |
| 650 | 7 | |a spanning tree |2 inriac | |
| 650 | 7 | |a suite Davenport-Schinzel |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial geometry | |
| 650 | 4 | |a Geometry |x Data processing | |
| 650 | 0 | 7 | |a Anordnung |g Mathematik |0 (DE-588)4211643-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ebene |0 (DE-588)4150968-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Anordnung |g Mathematik |0 (DE-588)4211643-0 |D s |
| 689 | 0 | 1 | |a Ebene |0 (DE-588)4150968-7 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-002865731 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 MAT 052f 2001 A 5175 |
|---|---|
| DE-BY-TUM_katkey | 538550 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010641093 |
| _version_ | 1821938278433030144 |
| any_adam_object | |
| author | Agarwal, Pankaj K. |
| author_facet | Agarwal, Pankaj K. |
| author_role | aut |
| author_sort | Agarwal, Pankaj K. |
| author_variant | p k a pk pka |
| building | Verbundindex |
| bvnumber | BV004664876 |
| callnumber-first | Q - Science |
| callnumber-label | QA167 |
| callnumber-raw | QA167 |
| callnumber-search | QA167 |
| callnumber-sort | QA 3167 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 ST 600 SK 890 |
| classification_tum | MAT 052d MAT 510d DAT 535d |
| ctrlnum | (OCoLC)231261924 (DE-599)BVBBV004664876 |
| dewey-full | 516/.13 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 516 - Geometry |
| dewey-raw | 516/.13 |
| dewey-search | 516/.13 |
| dewey-sort | 3516 213 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02217nam a2200661 c 4500</leader><controlfield tag="001">BV004664876</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220914 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">920109s1991 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521404460</subfield><subfield code="9">0-521-40446-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231261924</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004664876</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA167</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516/.13</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 052d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 510d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 535d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Agarwal, Pankaj K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Intersection and decomposition algorithms for planar arrangements</subfield><subfield code="c">Pankaj K. Agarwal</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 277 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 259 - 269</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Géométrie - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Géométrie - Informatique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Géométrie combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Géométrie combinatoire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme décomposition</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme intersection</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme partition</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">géométrie algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">spanning tree</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">suite Davenport-Schinzel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Anordnung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4211643-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ebene</subfield><subfield code="0">(DE-588)4150968-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Anordnung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4211643-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Ebene</subfield><subfield code="0">(DE-588)4150968-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002865731</subfield></datafield></record></collection> |
| id | DE-604.BV004664876 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T08:21:03Z |
| institution | BVB |
| isbn | 0521404460 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002865731 |
| oclc_num | 231261924 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-12 DE-384 DE-706 DE-634 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-12 DE-384 DE-706 DE-634 DE-11 DE-188 |
| physical | XVII, 277 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spellingShingle | Agarwal, Pankaj K. Intersection and decomposition algorithms for planar arrangements Algorithmes Algorithmes ram Géométrie - Informatique Géométrie - Informatique ram Géométrie combinatoire Géométrie combinatoire ram algorithme décomposition inriac algorithme intersection inriac algorithme partition inriac combinatoire inriac géométrie algorithmique inriac spanning tree inriac suite Davenport-Schinzel inriac Datenverarbeitung Algorithms Combinatorial geometry Geometry Data processing Anordnung Mathematik (DE-588)4211643-0 gnd Algorithmus (DE-588)4001183-5 gnd Ebene (DE-588)4150968-7 gnd |
| subject_GND | (DE-588)4211643-0 (DE-588)4001183-5 (DE-588)4150968-7 |
| title | Intersection and decomposition algorithms for planar arrangements |
| title_auth | Intersection and decomposition algorithms for planar arrangements |
| title_exact_search | Intersection and decomposition algorithms for planar arrangements |
| title_full | Intersection and decomposition algorithms for planar arrangements Pankaj K. Agarwal |
| title_fullStr | Intersection and decomposition algorithms for planar arrangements Pankaj K. Agarwal |
| title_full_unstemmed | Intersection and decomposition algorithms for planar arrangements Pankaj K. Agarwal |
| title_short | Intersection and decomposition algorithms for planar arrangements |
| title_sort | intersection and decomposition algorithms for planar arrangements |
| topic | Algorithmes Algorithmes ram Géométrie - Informatique Géométrie - Informatique ram Géométrie combinatoire Géométrie combinatoire ram algorithme décomposition inriac algorithme intersection inriac algorithme partition inriac combinatoire inriac géométrie algorithmique inriac spanning tree inriac suite Davenport-Schinzel inriac Datenverarbeitung Algorithms Combinatorial geometry Geometry Data processing Anordnung Mathematik (DE-588)4211643-0 gnd Algorithmus (DE-588)4001183-5 gnd Ebene (DE-588)4150968-7 gnd |
| topic_facet | Algorithmes Géométrie - Informatique Géométrie combinatoire algorithme décomposition algorithme intersection algorithme partition combinatoire géométrie algorithmique spanning tree suite Davenport-Schinzel Datenverarbeitung Algorithms Combinatorial geometry Geometry Data processing Anordnung Mathematik Algorithmus Ebene |
| work_keys_str_mv | AT agarwalpankajk intersectionanddecompositionalgorithmsforplanararrangements |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 MAT 052f 2001 A 5175 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |