Computational geometry: algorithms and applications
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
[2008]
|
| Ausgabe: | Third edition |
| Schlagworte: | |
| Online-Zugang: | BTU01 FUBA1 TUM01 UBW01 UPA01 UBR01 Volltext Inhaltsverzeichnis |
| Beschreibung: | 1 Online-Ressource (xii, 386 Seiten) Diagramme |
| ISBN: | 9783540779742 |
| DOI: | 10.1007/978-3-540-77974-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023394432 | ||
| 003 | DE-604 | ||
| 005 | 20220708 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 080714s2008 |||| o||u| ||||||eng d | ||
| 016 | 7 | |a 987108867 |2 DE-101 | |
| 020 | |a 9783540779742 |c Online |9 978-3-540-77974-2 | ||
| 024 | 7 | |a 10.1007/978-3-540-77974-2 |2 doi | |
| 035 | |a (OCoLC)873506689 | ||
| 035 | |a (DE-599)DNB987108867 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-706 |a DE-M347 |a DE-703 |a DE-91 |a DE-20 |a DE-739 |a DE-634 |a DE-634 |a DE-188 |a DE-11 |a DE-355 | ||
| 082 | 0 | |a 516.0028551 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a ST 320 |0 (DE-625)143657: |2 rvk | ||
| 084 | |a SK 380 |0 (DE-625)143235: |2 rvk | ||
| 084 | |a RB 10104 |0 (DE-625)142220:12617 |2 rvk | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a DAT 756f |2 stub | ||
| 100 | 1 | |a Berg, Mark Theodoor de |d 1966- |e Verfasser |0 (DE-588)1089186266 |4 aut | |
| 245 | 1 | 0 | |a Computational geometry |b algorithms and applications |c Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars |
| 250 | |a Third edition | ||
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c [2008] | |
| 264 | 4 | |c © 2008 | |
| 300 | |a 1 Online-Ressource (xii, 386 Seiten) |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |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 Cheong, Otfried |e Verfasser |0 (DE-588)143049119 |4 aut | |
| 700 | 1 | |a Kreveld, Marc van |d 1966- |e Verfasser |0 (DE-588)1158179685 |4 aut | |
| 700 | 1 | |a Overmars, Mark H. |d 1958- |e Verfasser |0 (DE-588)1089271069 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-540-77973-5 |w (DE-604)BV023180150 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-540-77974-2 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016577322&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-38-EBR |a ZDB-30-PQE |a ZDB-2-SCS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016577322 | ||
| 942 | 1 | 1 | |c 516 |e 22/bsb |f 0285 |
| 966 | e | |u https://doi.org/10.1007/978-3-540-77974-2 |l BTU01 |p ZDB-2-SCS |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/fuberlin-ebooks/detail.action?docID=6311912 |l FUBA1 |p ZDB-30-PQE |x Aggregator |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-540-77974-2 |l TUM01 |p ZDB-2-SCS |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/ub-wuerzburg/detail.action?docID=3062982 |l UBW01 |p ZDB-30-PQE |x Aggregator |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-540-77974-2 |l UPA01 |p ZDB-2-SCS |q UPA_Einzelkauf_Springer |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-540-77974-2 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804137773643333632 |
|---|---|
| adam_text | * BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/987108867 DIGITALISIERT
DURCH 8.4 LEVELS AND DISCREPANCY 185 CONTENTS 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 9]
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
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 12.7 EXERCISES 279 XI 8.5 NOTES AND COMMENTS
186 CONTENTS 8.6 EXERCISES 188 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 GEOMETRIE 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 CONVEXHULLS 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 XI1 CONTENTS 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 |
* BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/987108867 DIGITALISIERT
DURCH 8.4 LEVELS AND DISCREPANCY 185 CONTENTS 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 9]
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
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 12.7 EXERCISES 279 XI 8.5 NOTES AND COMMENTS
186 CONTENTS 8.6 EXERCISES 188 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 GEOMETRIE 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 CONVEXHULLS 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 XI1 CONTENTS 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 | Berg, Mark Theodoor de 1966- Cheong, Otfried Kreveld, Marc van 1966- Overmars, Mark H. 1958- |
| author_GND | (DE-588)1089186266 (DE-588)143049119 (DE-588)1158179685 (DE-588)1089271069 |
| author_facet | Berg, Mark Theodoor de 1966- Cheong, Otfried Kreveld, Marc van 1966- Overmars, Mark H. 1958- |
| author_role | aut aut aut aut |
| author_sort | Berg, Mark Theodoor de 1966- |
| author_variant | m t d b mtd mtdb o c oc m v k mv mvk m h o mh mho |
| building | Verbundindex |
| bvnumber | BV023394432 |
| classification_rvk | ST 134 ST 600 ST 320 SK 380 RB 10104 |
| classification_tum | DAT 000 DAT 756f |
| collection | ZDB-38-EBR ZDB-30-PQE ZDB-2-SCS |
| ctrlnum | (OCoLC)873506689 (DE-599)DNB987108867 |
| 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 |
| doi_str_mv | 10.1007/978-3-540-77974-2 |
| edition | Third edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03040nmm a2200613 c 4500</leader><controlfield tag="001">BV023394432</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220708 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">080714s2008 |||| o||u| ||||||eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">987108867</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540779742</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-540-77974-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-540-77974-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873506689</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB987108867</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516.0028551</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">ST 320</subfield><subfield code="0">(DE-625)143657:</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">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">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 756f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berg, Mark Theodoor de</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089186266</subfield><subfield code="4">aut</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, Otfried Cheong, Marc van Kreveld, Mark Overmars</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">[2008]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 386 Seiten)</subfield><subfield code="b">Diagramme</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">Cheong, Otfried</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)143049119</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kreveld, Marc van</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1158179685</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Overmars, Mark H.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089271069</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-540-77973-5</subfield><subfield code="w">(DE-604)BV023180150</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-540-77974-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=016577322&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-38-EBR</subfield><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016577322</subfield></datafield><datafield tag="942" ind1="1" ind2="1"><subfield code="c">516</subfield><subfield code="e">22/bsb</subfield><subfield code="f">0285</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77974-2</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/fuberlin-ebooks/detail.action?docID=6311912</subfield><subfield code="l">FUBA1</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77974-2</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/ub-wuerzburg/detail.action?docID=3062982</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77974-2</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UPA_Einzelkauf_Springer</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77974-2</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV023394432 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T21:21:19Z |
| indexdate | 2024-07-09T21:17:37Z |
| institution | BVB |
| isbn | 9783540779742 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016577322 |
| oclc_num | 873506689 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-706 DE-M347 DE-703 DE-91 DE-BY-TUM DE-20 DE-739 DE-634 DE-634 DE-188 DE-11 DE-355 DE-BY-UBR |
| owner_facet | DE-473 DE-BY-UBG DE-706 DE-M347 DE-703 DE-91 DE-BY-TUM DE-20 DE-739 DE-634 DE-634 DE-188 DE-11 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (xii, 386 Seiten) Diagramme |
| psigel | ZDB-38-EBR ZDB-30-PQE ZDB-2-SCS ZDB-2-SCS TUM_Einzelkauf ZDB-2-SCS UPA_Einzelkauf_Springer |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| spelling | Berg, Mark Theodoor de 1966- Verfasser (DE-588)1089186266 aut Computational geometry algorithms and applications Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars Third edition Berlin ; Heidelberg Springer [2008] © 2008 1 Online-Ressource (xii, 386 Seiten) Diagramme txt rdacontent c rdamedia cr rdacarrier Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Cheong, Otfried Verfasser (DE-588)143049119 aut Kreveld, Marc van 1966- Verfasser (DE-588)1158179685 aut Overmars, Mark H. 1958- Verfasser (DE-588)1089271069 aut Erscheint auch als Druck-Ausgabe 978-3-540-77973-5 (DE-604)BV023180150 https://doi.org/10.1007/978-3-540-77974-2 Verlag URL des Erstveröffentlichers Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016577322&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Berg, Mark Theodoor de 1966- Cheong, Otfried Kreveld, Marc van 1966- Overmars, Mark H. 1958- 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, Otfried Cheong, Marc van Kreveld, Mark Overmars |
| title_fullStr | Computational geometry algorithms and applications Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars |
| title_full_unstemmed | Computational geometry algorithms and applications Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars |
| 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 | https://doi.org/10.1007/978-3-540-77974-2 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016577322&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bergmarktheodoorde computationalgeometryalgorithmsandapplications AT cheongotfried computationalgeometryalgorithmsandapplications AT kreveldmarcvan computationalgeometryalgorithmsandapplications AT overmarsmarkh computationalgeometryalgorithmsandapplications |