Computational geometry: algorithms and applications
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2000
|
| Ausgabe: | 2., rev. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 341 - 357 |
| Beschreibung: | XII, 367 S. graph. Darst. ; 25 cm |
| ISBN: | 3540656200 9783540656203 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012916813 | ||
| 003 | DE-604 | ||
| 005 | 20210823 | ||
| 007 | t | ||
| 008 | 991214s2000 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 957903901 |2 DE-101 | |
| 020 | |a 3540656200 |9 3-540-65620-0 | ||
| 020 | |a 9783540656203 |9 978-3-540-65620-3 | ||
| 035 | |a (OCoLC)43076913 | ||
| 035 | |a (DE-599)BVBBV012916813 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-20 |a DE-739 |a DE-703 |a DE-384 |a DE-M347 |a DE-355 |a DE-473 |a DE-706 |a DE-91 |a DE-522 |a DE-526 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA448.D38 | |
| 082 | 0 | |a 516/.00285/51 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 320 |0 (DE-625)143657: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a 65Y25 |2 msc | ||
| 084 | |a 68U05 |2 msc | ||
| 084 | |a DAT 756f |2 stub | ||
| 245 | 1 | 0 | |a Computational geometry |b algorithms and applications |c Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf |
| 250 | |a 2., rev. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2000 | |
| 300 | |a XII, 367 S. |b graph. Darst. ; 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 341 - 357 | ||
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Computerwiskunde |2 gtt | |
| 650 | 4 | |a Géométrie - Informatique | |
| 650 | 7 | |a Meetkunde |2 gtt | |
| 650 | 7 | |a Toepassingen |2 gtt | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Geometry |x Data processing | |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Berg, Mark Theodoor de |d 1966- |e Sonstige |0 (DE-588)1089186266 |4 oth | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008793094&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008793094 | ||
Datensatz im Suchindex
| _version_ | 1804127605014659072 |
|---|---|
| adam_text | MARK DE BERG MARC VAN KREVELD MARK OVERMARS OTFRIED SCHWARZKOPF
COMPUTATIONAL GEOMETRY ALGORITHMS AND APPLICATIONS SECOND, REVISED
EDITION WITH 370 ILLUSTRATIONS SPRINGER CONTENTS 1 COMPUTATIONAL
GEOMETRY L INTRODUCTION 1.1 AN EXAMPLE: CONVEX HULLS 2 1.2 DEGENERACIES
AND ROBUSTNESS 8 1.3 APPLICATION DOMAINS 10 1.4 NOTES AND COMMENTS 13
1.5 EXERCISES 15 LINE SEGMENT INTERSECTION 19 THEMATIC MAP OVERLAY 2.1
LINE SEGMENT INTERSECTION 20 2.2 THE DOUBLY-CONNECTED EDGE LIST 29 2.3
COMPUTING THE OVERLAY OF TWO SUBDIVISIONS 33 2.4 BOOLEAN OPERATIONS 39
2.5 NOTES AND COMMENTS 40 2.6 EXERCISES 42 POLYGON TRIANGULATION 45
GUARDING AN ART GALLERY 3.1 GUARDING AND TRIANGULATIONS 46 3.2
PARTITIONING A POLYGON INTO MONOTONE PIECES 49 3.3 TRIANGULATING A
MONOTONE POLYGON 55 3.4 NOTES AND COMMENTS 59 3.5 EXERCISES 60 LINEAR
PROGRAMMING 63 MANUFACTURING WITH MOLDS 4.1 THE GEOMETRY OF CASTING 64
4.2 HALF-PLANE INTERSECTION 66 4.3 INCREMENTAL LINEAR PROGRAMMING 71 4.4
RANDOMIZED LINEAR PROGRAMMING 77 IX CONTENTS 4.5 UNBOUNDED LINEAR
PROGRAMS 80 4.6* LINEAR PROGRAMMING IN HIGHER DIMENSIONS 82 4.7*
SMALLEST ENCLOSING DISCS 86 4.8 NOTES AND COMMENTS 90 4.9 EXERCISES 91
ORTHOGONAL RANGE SEARCHING 95 QUERYING A DATABASE 5.1 1-DIMENSIONAL
RANGE SEARCHING 96 5.2 KD-TREES 99 5.3 RANGE TREES 105 5.4
HIGHER-DIMENSIONAL RANGE TREES 109 5.5 GENERAL SETS OF POINTS 111 5.6*
FRACTIONAL CASCADING 112 5.7 NOTES AND COMMENTS 115 5.8 EXERCISES 117
POINT LOCATION 121 KNOWING WHERE YOU ARE 6.1 POINT LOCATION AND
TRAPEZOIDAL MAPS 122 6.2 A RANDOMIZED INCREMENTAL ALGORITHM 128 6.3
DEALING WITH DEGENERATE CASES 137 6.4* A TAIL ESTIMATE 140 6.5 NOTES AND
COMMENTS 143 6.6 EXERCISES 144 VORONOI DIAGRAMS 147 THE POST OFFICE
PROBLEM 7.1 DEFINITION AND BASIC PROPERTIES 148 7.2 COMPUTING THE
VORONOI DIAGRAM 151 7.3 NOTES AND COMMENTS 160 7.4 EXERCISES 162
ARRANGEMENTS AND DUALITY 165 SUPERSAMPLING IN RAY TRACING 8.1 COMPUTING
THE DISCREPANCY 167 8.2 DUALITY 169 8.3 ARRANGEMENTS OF LINES 172 8.4
LEVELS AND DISCREPANCY 177 8.5 NOTES AND COMMENTS 178 8.6 EXERCISES 180
DELAUNAY TRIANGULATIONS 18 3 CONTENTS HEIGHT INTERPOLATION 9.1
TRIANGULATIONS OF PLANAR POINT SETS 185 9.2 THE DELAUNAY TRIANGULATION
188 9.3 COMPUTING THE DELAUNAY TRIANGULATION 191 9.4 THE ANALYSIS 197
9.5* A FRAMEWORK FOR RANDOMIZED ALGORITHMS 200 9.6 NOTES AND COMMENTS
206 9.7 EXERCISES 207 10 MORE GEOMETRIE DATA STRUCTURES 211 WINDOWING
10.1 INTERVAL TREES 212 10.2 PRIORITY SEARCH TREES 218 10.3 SEGMENT
TREES 223 10.4 NOTES AND COMMENTS 229 10.5 EXERCISES 230 11 CONVEX HULLS
235 MIXING THINGS 11.1 THE COMPLEXITY OF CONVEX HULLS IN 3-SPACE 236
11.2 COMPUTING CONVEX HULLS IN 3-SPACE 238 11.3* THE ANALYSIS 242 11.4*
CONVEX HULLS AND HALF-SPACE INTERSECTION 245 11.5* VORONOI DIAGRAMS
REVISITED 247 11.6 NOTES AND COMMENTS 248 11.7 EXERCISES 249 12 BINARY
SPACE PARTITIONS 251 THE PAINTER S ALGORITHM 12.1 THE DEFINITION OF BSP
TREES 253 12.2 BSP TREES AND THE PAINTER S ALGORITHM 255 12.3
CONSTRUCTING A BSP TREE 256 12.4* THE SIZE OF BSP TREES IN 3-SPACE 260
12.5 NOTES AND COMMENTS 263 12.6 EXERCISES 264 13 ROBOT MOTION PLANNING
267 GETTING WHERE YOU WANT TO BE 13.1 WORK SPACE AND CONFIGURATION SPACE
268 X I CONTENTS 13.2 A POINT ROBOT 270 13.3 MINKOWSKI SUMS 275 13.4
TRANSLATIONAL MOTION PLANNING 281 13.5* MOTION PLANNING WITH ROTATIONS
283 13.6 NOTES AND COMMENTS 287 13.7 EXERCISES 289 14 QUADTREES 291
NON-UNIFORM MESH GENERATION 14.1 UNIFORM AND NON-UNIFORM MESHES 292 14.2
QUADTREES FOR POINT SETS 293 14.3 FROM QUADTREES TO MESHES 300 14.4
NOTES AND COMMENTS 302 14.5 EXERCISES 304 15 VISIBILITY GRAPHS 307
FINDING THE SHORTEST ROUTE 15.1 SHORTEST PATHS FOR A POINT ROBOT 308
15.2 COMPUTING THE VISIBILITY GRAPH 310 15.3 SHORTEST PATHS FOR A
TRANSLATING POLYGONAL ROBOT 314 15.4 NOTES AND COMMENTS 315 15.5
EXERCISES 316 16 SIMPLEX RANGE SEARCHING 319 WINDOWING REVISITED 16.1
PARTITION TREES 320 16.2 MULTI-LEVEL PARTITION TREES 327 16.3 CUTTING
TREES 330 16.4 NOTES AND COMMENTS 336 16.5 EXERCISES 337 BIBLIOGRAPHY
341 INDEX 359 XU
|
| any_adam_object | 1 |
| author_GND | (DE-588)1089186266 |
| building | Verbundindex |
| bvnumber | BV012916813 |
| callnumber-first | Q - Science |
| callnumber-label | QA448 |
| callnumber-raw | QA448.D38 |
| callnumber-search | QA448.D38 |
| callnumber-sort | QA 3448 D38 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 ST 320 ST 600 |
| classification_tum | DAT 756f |
| ctrlnum | (OCoLC)43076913 (DE-599)BVBBV012916813 |
| dewey-full | 516/.00285/51 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 516 - Geometry |
| dewey-raw | 516/.00285/51 |
| dewey-search | 516/.00285/51 |
| dewey-sort | 3516 3285 251 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | 2., rev. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02045nam a2200541 c 4500</leader><controlfield tag="001">BV012916813</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210823 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">991214s2000 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">957903901</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540656200</subfield><subfield code="9">3-540-65620-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540656203</subfield><subfield code="9">978-3-540-65620-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)43076913</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012916813</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA448.D38</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516/.00285/51</subfield><subfield code="2">21</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">ST 320</subfield><subfield code="0">(DE-625)143657:</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">65Y25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68U05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 756f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational geometry</subfield><subfield code="b">algorithms and applications</subfield><subfield code="c">Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2., rev. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 367 S.</subfield><subfield code="b">graph. Darst. ; 25 cm</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. 341 - 357</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerwiskunde</subfield><subfield code="2">gtt</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">Meetkunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Toepassingen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Berg, Mark Theodoor de</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1089186266</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008793094&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008793094</subfield></datafield></record></collection> |
| id | DE-604.BV012916813 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:36:00Z |
| institution | BVB |
| isbn | 3540656200 9783540656203 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008793094 |
| oclc_num | 43076913 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-20 DE-739 DE-703 DE-384 DE-M347 DE-355 DE-BY-UBR DE-473 DE-BY-UBG DE-706 DE-91 DE-BY-TUM DE-522 DE-526 DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-20 DE-739 DE-703 DE-384 DE-M347 DE-355 DE-BY-UBR DE-473 DE-BY-UBG DE-706 DE-91 DE-BY-TUM DE-522 DE-526 DE-83 DE-11 DE-188 |
| physical | XII, 367 S. graph. Darst. ; 25 cm |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| spelling | Computational geometry algorithms and applications Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf 2., rev. ed. Berlin [u.a.] Springer 2000 XII, 367 S. graph. Darst. ; 25 cm txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 341 - 357 Algoritmen gtt Computerwiskunde gtt Géométrie - Informatique Meetkunde gtt Toepassingen gtt Datenverarbeitung Geometry Data processing Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Berg, Mark Theodoor de 1966- Sonstige (DE-588)1089186266 oth GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008793094&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Computational geometry algorithms and applications Algoritmen gtt Computerwiskunde gtt Géométrie - Informatique Meetkunde gtt Toepassingen gtt Datenverarbeitung Geometry Data processing Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4130267-9 |
| title | Computational geometry algorithms and applications |
| title_auth | Computational geometry algorithms and applications |
| title_exact_search | Computational geometry algorithms and applications |
| title_full | Computational geometry algorithms and applications Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf |
| title_fullStr | Computational geometry algorithms and applications Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf |
| title_full_unstemmed | Computational geometry algorithms and applications Mark de Berg ; Marc van Kreveld ; Mark Overmars ; Otfried Schwarzkopf |
| title_short | Computational geometry |
| title_sort | computational geometry algorithms and applications |
| title_sub | algorithms and applications |
| topic | Algoritmen gtt Computerwiskunde gtt Géométrie - Informatique Meetkunde gtt Toepassingen gtt Datenverarbeitung Geometry Data processing Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Algoritmen Computerwiskunde Géométrie - Informatique Meetkunde Toepassingen Datenverarbeitung Geometry Data processing Algorithmische Geometrie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008793094&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bergmarktheodoorde computationalgeometryalgorithmsandapplications |