Computational geometry: algorithms and applications
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2008
|
| Ausgabe: | 3. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis Inhaltsverzeichnis |
| Beschreibung: | XII, 386 S. graph. Darst. |
| ISBN: | 9783540779735 9783642096815 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023180150 | ||
| 003 | DE-604 | ||
| 005 | 20210301 | ||
| 007 | t | ||
| 008 | 080222s2008 gw d||| |||| 00||| eng d | ||
| 020 | |a 9783540779735 |9 978-3-540-77973-5 | ||
| 020 | |a 9783642096815 |9 978-3-642-09681-5 | ||
| 035 | |a (OCoLC)244014836 | ||
| 035 | |a (DE-599)BVBBV023180150 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-M347 |a DE-20 |a DE-739 |a DE-634 |a DE-384 |a DE-83 |a DE-703 |a DE-29T |a DE-859 |a DE-91 |a DE-91G |a DE-824 |a DE-188 |a DE-858 |a DE-M49 |a DE-2174 |a DE-355 |a DE-11 | ||
| 082 | 0 | |a 516.0028551 |2 22/ger | |
| 084 | |a RB 10104 |0 (DE-625)142220:12617 |2 rvk | ||
| 084 | |a SK 380 |0 (DE-625)143235: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 320 |0 (DE-625)143657: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a 68U05 |2 msc | ||
| 084 | |a 65Y25 |2 msc | ||
| 084 | |a DAT 756f |2 stub | ||
| 245 | 1 | 0 | |a Computational geometry |b algorithms and applications |c Mark de Berg ... |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2008 | |
| 300 | |a XII, 386 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 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 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-540-77974-2 |
| 856 | 4 | |q pdf/application |u http://www.ulb.tu-darmstadt.de/tocs/199345678.pdf |3 Inhaltsverzeichnis | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016366691&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016366691 | ||
Datensatz im Suchindex
| _version_ | 1804137447062241280 |
|---|---|
| adam_text | Contents
1 Computational Geometry 1
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
2 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 41
3 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
4 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 76
4.5 Unbounded Linear Programs 79
4.6* Linear Programming in Higher Dimensions 82
4.7* Smallest Enclosing Discs 86
4.8 Notes and Comments 89
4.9 Exercises 91
5 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 110
5.6* Fractional Cascading 111
5.7 Notes and Comments 115
5.8 Exercises 117
6 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
7 Voronoi Diagrams 147
The Post Office Problem
7.1 Definition and Basic Properties 148
7.2 Computing the Voronoi Diagram 151
7.3 Voronoi Diagrams of Line Segments 160
7.4 Farthest-Point Voronoi Diagrams 163
7.5 Notes and Comments 167
7.6 Exercises 170
8 Arrangements and Duality 173
Supersampling in Ray Tracing
8.1 Computing the Discrepancy 175
8.2 Duality 177
8.3 Arrangements of Lines 179
8.4 Levels and Discrepancy 185
8.5 Notes and Comments 186
8.6 Exercises 188
9 Delaunay Triangulations 191
Height Interpolation
9.1 Triangulations of Planar Point Sets 193
9.2 The Delaunay Triangulation 196
9.3 Computing the Delaunay Triangulation 199
9.4 The Analysis 205
9.5* A Framework for Randomized Algorithms 208
9.6 Notes and Comments 214
9.7 Exercises 215
10 More Geometric Data Structures 219
Windowing
10.1 Interval Trees 220
10.2 Priority Search Trees 226
10.3 Segment Trees 231
10.4 Notes and Comments 237
10.5 Exercises 239
11 Convex Hulls 243
Mixing Things
11.1 The Complexity of Convex Hulls in 3-Space 244
11.2 Computing Convex Hulls in 3-Space 246
11.3* The Analysis 250
11.4* Convex Hulls and Half-Space Intersection 253
11.5* Voronoi Diagrams Revisited 254
11.6 Notes and Comments 256
11.7 Exercises 257
12 Binary Space Partitions 259
The Painter s Algorithm
12.1 The Definition of BSP Trees 261
12.2 BSP Trees and the Painter s Algorithm 263
12.3 Constructing a BSP Tree 264
12.4* The Size of BSP Trees in 3-Space 268
12.5 BSP Trees for Low-Density Scenes 271
12.6 Notes and Comments 278
12.7 Exercises 279
13 Robot Motion Planning 283
Getting Where You Want to Be
13.1 Work Space and Configuration Space 284
13.2 A Point Robot 286
13.3 Minkowski Sums 290
13.4 Translational Motion Planning 297
13.5* Motion Planning with Rotations 299
13.6 Notes and Comments 303
13.7 Exercises 305
14 Quadtrees 307
Non-Uniform Mesh Generation
14.1 Uniform and Non-Uniform Meshes 308
14.2 Quadtrees for Point Sets 309
14.3 From Quadtrees to Meshes 315
14.4 Notes and Comments 318
14.5 Exercises 320
15 Visibility Graphs 323
Finding the Shortest Route
15.1 Shortest Paths for a Point Robot 324
15.2 Computing the Visibility Graph 326
15.3 Shortest Paths for a Translating Polygonal Robot 330
15.4 Notes and Comments 331
15.5 Exercises 332
16 Simplex Range Searching 335
Windowing Revisited
16.1 Partition Trees 336
16.2 Multi-Level Partition Trees 343
16.3 Cutting Trees 346
16.4 Notes and Comments 352
16.5 Exercises 353
Bibliography 357
Index 377
|
| adam_txt |
Contents
1 Computational Geometry 1
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
2 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 41
3 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
4 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 76
4.5 Unbounded Linear Programs 79
4.6* Linear Programming in Higher Dimensions 82
4.7* Smallest Enclosing Discs 86
4.8 Notes and Comments 89
4.9 Exercises 91
5 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 110
5.6* Fractional Cascading 111
5.7 Notes and Comments 115
5.8 Exercises 117
6 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
7 Voronoi Diagrams 147
The Post Office Problem
7.1 Definition and Basic Properties 148
7.2 Computing the Voronoi Diagram 151
7.3 Voronoi Diagrams of Line Segments 160
7.4 Farthest-Point Voronoi Diagrams 163
7.5 Notes and Comments 167
7.6 Exercises 170
8 Arrangements and Duality 173
Supersampling in Ray Tracing
8.1 Computing the Discrepancy 175
8.2 Duality 177
8.3 Arrangements of Lines 179
8.4 Levels and Discrepancy 185
8.5 Notes and Comments 186
8.6 Exercises 188
9 Delaunay Triangulations 191
Height Interpolation
9.1 Triangulations of Planar Point Sets 193
9.2 The Delaunay Triangulation 196
9.3 Computing the Delaunay Triangulation 199
9.4 The Analysis 205
9.5* A Framework for Randomized Algorithms 208
9.6 Notes and Comments 214
9.7 Exercises 215
10 More Geometric Data Structures 219
Windowing
10.1 Interval Trees 220
10.2 Priority Search Trees 226
10.3 Segment Trees 231
10.4 Notes and Comments 237
10.5 Exercises 239
11 Convex Hulls 243
Mixing Things
11.1 The Complexity of Convex Hulls in 3-Space 244
11.2 Computing Convex Hulls in 3-Space 246
11.3* The Analysis 250
11.4* Convex Hulls and Half-Space Intersection 253
11.5* Voronoi Diagrams Revisited 254
11.6 Notes and Comments 256
11.7 Exercises 257
12 Binary Space Partitions 259
The Painter's Algorithm
12.1 The Definition of BSP Trees 261
12.2 BSP Trees and the Painter's Algorithm 263
12.3 Constructing a BSP Tree 264
12.4* The Size of BSP Trees in 3-Space 268
12.5 BSP Trees for Low-Density Scenes 271
12.6 Notes and Comments 278
12.7 Exercises 279
13 Robot Motion Planning 283
Getting Where You Want to Be
13.1 Work Space and Configuration Space 284
13.2 A Point Robot 286
13.3 Minkowski Sums 290
13.4 Translational Motion Planning 297
13.5* Motion Planning with Rotations 299
13.6 Notes and Comments 303
13.7 Exercises 305
14 Quadtrees 307
Non-Uniform Mesh Generation
14.1 Uniform and Non-Uniform Meshes 308
14.2 Quadtrees for Point Sets 309
14.3 From Quadtrees to Meshes 315
14.4 Notes and Comments 318
14.5 Exercises 320
15 Visibility Graphs 323
Finding the Shortest Route
15.1 Shortest Paths for a Point Robot 324
15.2 Computing the Visibility Graph 326
15.3 Shortest Paths for a Translating Polygonal Robot 330
15.4 Notes and Comments 331
15.5 Exercises 332
16 Simplex Range Searching 335
Windowing Revisited
16.1 Partition Trees 336
16.2 Multi-Level Partition Trees 343
16.3 Cutting Trees 346
16.4 Notes and Comments 352
16.5 Exercises 353
Bibliography 357
Index 377 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author_GND | (DE-588)1089186266 |
| building | Verbundindex |
| bvnumber | BV023180150 |
| classification_rvk | RB 10104 SK 380 ST 134 ST 320 ST 600 |
| classification_tum | DAT 756f |
| ctrlnum | (OCoLC)244014836 (DE-599)BVBBV023180150 |
| dewey-full | 516.0028551 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 516 - Geometry |
| dewey-raw | 516.0028551 |
| dewey-search | 516.0028551 |
| dewey-sort | 3516.0028551 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Geographie |
| discipline_str_mv | Informatik Mathematik Geographie |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01926nam a2200469 c 4500</leader><controlfield tag="001">BV023180150</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210301 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080222s2008 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540779735</subfield><subfield code="9">978-3-540-77973-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642096815</subfield><subfield code="9">978-3-642-09681-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)244014836</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023180150</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-M49</subfield><subfield code="a">DE-2174</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516.0028551</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">RB 10104</subfield><subfield code="0">(DE-625)142220:12617</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 380</subfield><subfield code="0">(DE-625)143235:</subfield><subfield code="2">rvk</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 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">68U05</subfield><subfield code="2">msc</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">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 ...</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 386 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="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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-540-77974-2</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">pdf/application</subfield><subfield code="u">http://www.ulb.tu-darmstadt.de/tocs/199345678.pdf</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=016366691&sequence=000002&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-016366691</subfield></datafield></record></collection> |
| id | DE-604.BV023180150 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:01:11Z |
| indexdate | 2024-07-09T21:12:26Z |
| institution | BVB |
| isbn | 9783540779735 9783642096815 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016366691 |
| oclc_num | 244014836 |
| open_access_boolean | |
| owner | DE-M347 DE-20 DE-739 DE-634 DE-384 DE-83 DE-703 DE-29T DE-859 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-824 DE-188 DE-858 DE-M49 DE-BY-TUM DE-2174 DE-355 DE-BY-UBR DE-11 |
| owner_facet | DE-M347 DE-20 DE-739 DE-634 DE-384 DE-83 DE-703 DE-29T DE-859 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-824 DE-188 DE-858 DE-M49 DE-BY-TUM DE-2174 DE-355 DE-BY-UBR DE-11 |
| physical | XII, 386 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| spelling | Computational geometry algorithms and applications Mark de Berg ... 3. ed. Berlin [u.a.] Springer 2008 XII, 386 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier 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 Erscheint auch als Online-Ausgabe 978-3-540-77974-2 pdf/application http://www.ulb.tu-darmstadt.de/tocs/199345678.pdf Inhaltsverzeichnis HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016366691&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Computational geometry algorithms and applications 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_exact_search_txtP | Computational geometry algorithms and applications |
| title_full | Computational geometry algorithms and applications Mark de Berg ... |
| title_fullStr | Computational geometry algorithms and applications Mark de Berg ... |
| title_full_unstemmed | Computational geometry algorithms and applications Mark de Berg ... |
| title_short | Computational geometry |
| title_sort | computational geometry algorithms and applications |
| title_sub | algorithms and applications |
| topic | Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Algorithmische Geometrie |
| url | http://www.ulb.tu-darmstadt.de/tocs/199345678.pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016366691&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bergmarktheodoorde computationalgeometryalgorithmsandapplications |
Es ist kein Print-Exemplar vorhanden.
Inhaltsverzeichnis