Algorithms in combinatorial geometry:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1987
|
| Schriftenreihe: | European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science
10. |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000481214&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Beschreibung: | Literaturverz. S. [381] - 394 |
| Umfang: | XV, 423 S. graph. Darst. |
| ISBN: | 354013722X 038713722X |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000768855 | ||
| 003 | DE-604 | ||
| 005 | 20220921 | ||
| 007 | t| | ||
| 008 | 880705s1987 xx d||| |||| 00||| eng d | ||
| 020 | |a 354013722X |9 3-540-13722-X | ||
| 020 | |a 038713722X |9 0-387-13722-X | ||
| 035 | |a (OCoLC)16227273 | ||
| 035 | |a (DE-599)BVBBV000768855 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91 |a DE-91G |a DE-384 |a DE-703 |a DE-739 |a DE-355 |a DE-20 |a DE-824 |a DE-29T |a DE-19 |a DE-92 |a DE-706 |a DE-634 |a DE-11 |a DE-188 |a DE-83 | ||
| 050 | 0 | |a QA167 | |
| 082 | 0 | |a 516/.13 |2 19 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a 51D20 |2 msc | ||
| 084 | |a MAT 050f |2 stub | ||
| 084 | |a 68E99 |2 msc | ||
| 084 | |a 05B25 |2 msc | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a DAT 756f |2 stub | ||
| 100 | 1 | |a Edelsbrunner, Herbert |d 1958- |e Verfasser |0 (DE-588)111356377 |4 aut | |
| 245 | 1 | 0 | |a Algorithms in combinatorial geometry |c Herbert Edelsbrunner |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1987 | |
| 300 | |a XV, 423 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science |v 10. | |
| 500 | |a Literaturverz. S. [381] - 394 | ||
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Combinatorische meetkunde |2 gtt | |
| 650 | 4 | |a Géométrie - Informatique | |
| 650 | 4 | |a Géométrie combinatoire | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Combinatorial geometry | |
| 650 | 4 | |a Geometry |x Data processing | |
| 650 | 0 | 7 | |a Kombinatorische Geometrie |0 (DE-588)4140733-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Geometrie |0 (DE-588)4140733-7 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science |v 10. |w (DE-604)BV005600727 |9 10 | |
| 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=000481214&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-000481214 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 89 A 3544 0102 DAT 535f 2001 A 13108 0102 DAT 756f 2001 A 13107 0834 IN.124 |
|---|---|
| DE-BY-TUM_katkey | 84831 |
| DE-BY-TUM_location | Mag 01 LSB |
| DE-BY-TUM_media_number | 040000517762 040010692594 040020251183 TEMP3027799 |
| _version_ | 1821931085583351808 |
| adam_text | TABLE OF CONTENTS
PART I COMBINATORIAL GEOMETRY 1
CHAPTER 1 Fundamental Concepts in Combinatorial Geometry 3
1.1. Arrangements of Hyperplanes 4
1.2. Counting Faces and Incidences 6
1.3. Combinatorial Equivalence 10
1.4. Configurations of Points 12
1.5. Sylvester s Problem 15
1.6. Convex Polytopes and Convex Polyhedra 16
1.7. Zonotopes 20
1.8. Voronoi Diagrams 23
1.9. Exercises and Research Problems 25
1.10. Bibliographic Notes 27
CHAPTER 2 Permutation Tables 29
2.1. Circular Sequences 29
2.2. Encoding Arrangements and Configurations 32
2.3. A Circularly Non Realizable 5 Sequence 35
2.4. Arrangements of Pseudo Lines 37
2.5. Some Combinatorial Problems in the Plane 39
2.6. Exercises and Research Problems 41
2.7. Bibliographic Notes 44
CHAPTER 3 Semispaces of Configurations 45
3.1. Semispaces and Arrangements 46
3.2. fc Sets and Levels in Arrangements 47
3.3. A Lower Bound on the Number of Bisections in the Plane 50
3.4. Lower Bounds on the Number of fc Sets in the Plane 52
3.5. Extensions to Three and Higher Dimensions 54
3.6. Semispaces and Circular Sequences 55
3.7. An Upper Bound on the Number of fc Sets in the Plane 58
3.8. Exercises and Research Problems 60
3.9. Bibliographic Notes 61
XII
CHAPTER 4 Dissections of Point Sets 63
4.1. Centerpoints 63
4.2. Ham Sandwich Cuts 66
4.3. Erasing Subdivisions in the Plane 70
4.4. Simultaneous Four Section in Three Dimensions 73
4.5. Erasing Cell Complexes in Three Dimensions 77
4.6. Generalizations to Higher Dimensions 78
4.7. Exercises and Research Problems 79
4.8. Bibliographic Notes 81
CHAPTER 5 Zones in Arrangements 83
5.1. Supported Cells, Zones, and Duality 84
5.2. Sweeping a Simple Arrangement 86
5.3. Tight Bounds in the Plane 89
5.4. Asymptotically Tight Bounds in d Dimensions 93
5.5. An Implication of the Result on Zones 94
5.6. Exercises and Research Problems 95
5.7. Bibliographic Notes 96
CHAPTER 6 The Complexity of Families of Cells 97
6.1. Definitions and Preliminary Results 98
6.2. The Complexity of a Polytope 99
6.2.1. Cyclic Polytopes 100
6.2.2. Euler s Relation 102
6.2.3. The Dehn Sommerville Relations 104
6.2.4. An Asymptotic Version of the Upper Bound Theorem 106
6.3. The Complexity of a Few Cells in Two Dimensions 107
6.4. Lower Bounds for Moderately Many Cells 109
6.5. Lower Bounds for Many Cells Ill
6.6. Upper Bounds for Many Cells 114
6.7. Exercises and Research Problems 116
6.8. Bibliographic Notes 118
PART II FUNDAMENTAL GEOMETRIC ALGORITHMS 121
CHAPTER 7 Constructing Arrangements 123
7.1. Representing an Arrangement in Storage 123
7.2. The Incremental Approach 125
7.3. Initiating the Construction 126
7.4. Geometric Preliminaries 128
7.5. Incrementing the Arrangement 130
7.6. The Analysis of the Algorithm 134
7.7. Exercises and Research Problems 136
XIII
7.8. Bibliographic Notes 137
CHAPTER 8 Constructing Convex Hulls 139
8.1. Convex Hulls and Duality 140
8.2. The Incidence Graph of a Convex Polytope 141
8.3. Two Algorithms in Two Dimensions 142
8.3.1. The Beneath Beyond Method 143
8.3.2. Using Divide and Conquer 145
8.4. The Beneath Beyond Method in d Dimensions 147
8.4.1. Geometric Preliminaries 148
8.4.2. Towards the Incrementation of the Convex Hull 152
8.4.3. Pyramidal Updates 153
8.4.4. Non Pyramidal Updates 154
8.4.5. The Analysis of the Algorithm 156
8.5. Divide and Conquer in Three Dimensions 158
8.5.1. Coping with Degenerate Cases 159
8.5.2. The Upgraded Incidence Graph 160
8.5.3. Geometric Preliminaries 162
8.5.4. Wrapping Two Convex Polytopes 167
8.5.5. The Analysis of the Algorithm 172
8.6. Exercises and Research Problems 173
8.7. Bibliographic Notes 175
CHAPTER 9 Skeletons in Arrangements 177
9.1. Skeletons and Eulerian Tours 178
9.2. Towards the Construction of a Skeleton 181
9.3. Constructing a Skeleton in a Simple Arrangement 183
9.4. Simulating Simplicity 185
9.4.1. A Conceptual Perturbation 186
9.4.2. Simulating the Perturbation 188
9.4.3. Computing the Sign of a Determinant of Polynomials 190
9.5. Penetration Search and Extremal Queries 192
9.5.1. Extremal Queries in the Plane 193
9.5.2. Extremal Queries in Three Dimensions: the Data Structure 195
9.5.3. Extremal Queries in Three Dimensions: the Query Algorithm 201
9.5.4. Dynamic Extremal Search 202
9.6. Exercises and Research Problems 205
9.7. Bibliographic Notes 208
CHAPTER 10 Linear Programming 209
10.1. The Solution to a Linear Program 210
10.2. Linear Programming and Duality 212
10.3. Linear Programming in Two Dimensions 214
XIV
10.3.1. Prune: Eliminate Redundant Half Planes 215
10.3.2. Bisect: Decrease the Range of the Linear Program 217
10.3.3. Find_Test: Determine the Median 219
10.3.4. Assembling the Algorithm 220
10.4. Linear Programming in Three and Higher Dimensions 223
10.4.1. The Geometry of Pruning 224
10.4.2. The Geometry of Bisecting 225
10.4.3. Searching Lines in the Plane 228
10.4.4. The Geometry of Searching 230
10.4.5. The Overall Algorithm 234
10.5. Exercises and Research Problems 236
10.6. Bibliographic Notes 238
CHAPTER 11 Planar Point Location Search 241
11.1. Euler s Relation for Planar Graphs 242
11.2. The Geometry of Monotone Subdivisions 244
11.3. A Tree of Separators for Point Location 218
11.4. Representing a Plane Subdivision 251
11.5. Constructing a Family of Separators 252
11.6. Optimal Search by Connecting Separators 256
11.7. Constructing the Layered DAG 258
11.8. Refining Non Monotone Subdivisions 260
11.9. Exercises and Research Problems 262
11.10. Bibliographic Notes 265
PART HI GEOMETRIC AND ALGORITHMIC APPLICATIONS 269
CHAPTER 12 Problems for Configurations and Arrangements 271
12.1. Largest Convex Subsets 272
12.2. The Visibility Graph for Line Segments 275
12.3. Degeneracies in Configurations 278
12.4. Minimum Measure Simplices 282
12.5. Computing Ranks: Sorting in d Dimensions? 284
12.6. A Vector Sum Maximization Problem 286
12.7. Exercises and Research Problems 288
12.8. Bibliographic Notes 290
CHAPTER 13 Voronoi Diagrams 293
13.1. Classical Voronoi Diagrams 294
13.2. Applications in the Plane 298
13.2.1. The Post Office Problem 298
13.2.2. Triangulating Point Sets 299
13.2.3. Delaunay Triangulations from Convex Hulls 303
XV
13.2.4. Finding Closest Neighbors 306
13.2.5. Minimum Spanning Trees 306
13.2.6. Shapes of Point Sets 309
13.3. Higher Order Voronoi Diagrams 315
13.4. The Complexity of Higher Order Voronoi Diagrams 319
13.5. Constructing Higher Order Voronoi Diagrams 324
13.6. Power Diagrams 327
13.7. Exercises and Research Problems 328
13.8. Bibliographic Notes 332
CHAPTER 14 Separation and Intersection in the Plane 335
14.1. Constructing Ham Sandwich Cuts in Two Dimensions 336
14.1.1. Ham Sandwich Cuts and Duality 336
14.1.2. Testing a Line 339
14.1.3. Finding Test Lines and Pruning 341
14.1.4. The Overall Algorithm 343
14.2. Answering Line Queries 345
14.2.1. The Ham Sandwich Tree 345
14.2.2. Point Location in Arrangements 348
14.3. A Self Dual Intersection Problem 349
14.4. Triangular Range Queries 351
14.5. Exercises and Research Problems 354
14.6. Bibliographic Notes 356
CHAPTER 15 Paradigmatic Design of Algorithms 359
15.1. The Problem: Stabbing Line Segments in the Plane 359
15.2. Geometric Transformation 361
15.3. Combinatorial Analysis 363
15.4. Divide and Conquer 365
15.5. Incremental Construction 367
15.6. Prune and Search 370
15.7. The Locus Approach 371
15.8. Dynamization by Decomposition 373
15.9. Exercises and Research Problems 376
i 15.10. Bibliographic Notes 378
REFERENCES 381
APPENDIX A Definitions 395
APPENDIX B Notational Conventions 409
INDEX 417
|
| any_adam_object | 1 |
| author | Edelsbrunner, Herbert 1958- |
| author_GND | (DE-588)111356377 |
| author_facet | Edelsbrunner, Herbert 1958- |
| author_role | aut |
| author_sort | Edelsbrunner, Herbert 1958- |
| author_variant | h e he |
| building | Verbundindex |
| bvnumber | BV000768855 |
| 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 SK 890 ST 130 ST 600 |
| classification_tum | MAT 050f DAT 537f DAT 756f |
| ctrlnum | (OCoLC)16227273 (DE-599)BVBBV000768855 |
| 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 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02431nam a2200601 cb4500</leader><controlfield tag="001">BV000768855</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220921 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">880705s1987 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354013722X</subfield><subfield code="9">3-540-13722-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">038713722X</subfield><subfield code="9">0-387-13722-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16227273</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000768855</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-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-92</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><subfield code="a">DE-83</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">19</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">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 130</subfield><subfield code="0">(DE-625)143588:</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">51D20</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68E99</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05B25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</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">Edelsbrunner, Herbert</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)111356377</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms in combinatorial geometry</subfield><subfield code="c">Herbert Edelsbrunner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 423 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="490" ind1="1" ind2=" "><subfield code="a">European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science</subfield><subfield code="v">10.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [381] - 394</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">Combinatorische meetkunde</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="4"><subfield code="a">Géométrie combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</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">Kombinatorische Geometrie</subfield><subfield code="0">(DE-588)4140733-7</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="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Geometrie</subfield><subfield code="0">(DE-588)4140733-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="830" ind1=" " ind2="0"><subfield code="a">European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science</subfield><subfield code="v">10.</subfield><subfield code="w">(DE-604)BV005600727</subfield><subfield code="9">10</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=000481214&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000481214</subfield></datafield></record></collection> |
| id | DE-604.BV000768855 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T07:26:24Z |
| institution | BVB |
| isbn | 354013722X 038713722X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000481214 |
| oclc_num | 16227273 |
| open_access_boolean | |
| owner | DE-12 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-355 DE-BY-UBR DE-20 DE-824 DE-29T DE-19 DE-BY-UBM DE-92 DE-706 DE-634 DE-11 DE-188 DE-83 |
| owner_facet | DE-12 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-355 DE-BY-UBR DE-20 DE-824 DE-29T DE-19 DE-BY-UBM DE-92 DE-706 DE-634 DE-11 DE-188 DE-83 |
| physical | XV, 423 S. graph. Darst. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Springer |
| record_format | marc |
| series | European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science |
| series2 | European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science |
| spellingShingle | Edelsbrunner, Herbert 1958- Algorithms in combinatorial geometry European Association for Theoretical Computer Science: EATCS monographs on theoretical computer science Algoritmen gtt Combinatorische meetkunde gtt Géométrie - Informatique Géométrie combinatoire Datenverarbeitung Combinatorial geometry Geometry Data processing Kombinatorische Geometrie (DE-588)4140733-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4140733-7 (DE-588)4001183-5 |
| title | Algorithms in combinatorial geometry |
| title_auth | Algorithms in combinatorial geometry |
| title_exact_search | Algorithms in combinatorial geometry |
| title_full | Algorithms in combinatorial geometry Herbert Edelsbrunner |
| title_fullStr | Algorithms in combinatorial geometry Herbert Edelsbrunner |
| title_full_unstemmed | Algorithms in combinatorial geometry Herbert Edelsbrunner |
| title_short | Algorithms in combinatorial geometry |
| title_sort | algorithms in combinatorial geometry |
| topic | Algoritmen gtt Combinatorische meetkunde gtt Géométrie - Informatique Géométrie combinatoire Datenverarbeitung Combinatorial geometry Geometry Data processing Kombinatorische Geometrie (DE-588)4140733-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algoritmen Combinatorische meetkunde Géométrie - Informatique Géométrie combinatoire Datenverarbeitung Combinatorial geometry Geometry Data processing Kombinatorische Geometrie Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000481214&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV005600727 |
| work_keys_str_mv | AT edelsbrunnerherbert algorithmsincombinatorialgeometry |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 89 A 3544 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 535f 2001 A 13108 Lageplan 0102 DAT 756f 2001 A 13107 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |
| Exemplar 2 | Ausleihbar Am Standort |
Handapparate (nicht verfügbar)
| Signatur: |
0834 IN.124 Lageplan |
|---|---|
| Exemplar 1 | Dauerhaft ausgeliehen Ausgeliehen |