Computational Geometry: Algorithms and ApplicationsSpringer Science & Business Media, 09.03.2013 - 367 Seiten Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study. |
Was andere dazu sagen - Rezension schreiben
Es wurden keine Rezensionen gefunden.
Inhalt
2 | |
Line Segment Intersection | 19 |
Polygon Triangulation | 45 |
Linear Programming | 63 |
CONTENTS | 72 |
Orthogonal Range Searching | 93 |
Point Location | 119 |
5 | 125 |
The Painters Algorithm | 249 |
Getting Where You Want to | 265 |
2 A Point Robot | 268 |
Quadtrees | 289 |
Visibility Graphs | 305 |
Simplex Range Searching | 317 |
339 | |
340 | |
Voronoi Diagrams | 145 |
Arrangements and Duality | 163 |
4 | 170 |
9 | 181 |
Windowing | 209 |
Mixing Things | 233 |
103 | 344 |
1 | 346 |
353 | |
356 | |
Andere Ausgaben - Alle anzeigen
Computational Geometry: Algorithms and Applications de Berg (M.T.),Marc Van Kreveld,Mark Overmars,Otfried Schwarzkopf Eingeschränkte Leseprobe - 2000 |
Computational Geometry: Algorithms and Applications Mark de Berg,Marc van Krefeld,Mark Overmars,Otfried Cheong Eingeschränkte Leseprobe - 2013 |
Computational Geometry: Algorithms and Applications Mark de Berg,Mark Overmars Eingeschränkte Leseprobe - 1997 |
Häufige Begriffe und Wortgruppen
associated structure beach line BINARY SPACE PARTITIONS bound boundary BSP tree canonical subsets Chapter circle event complexity compute configuration space construct contains convex hull convex polygon corresponding cutting tree data structure defined Delaunay triangulation denote disjoint doubly-connected edge list facets Figure free space geometric half-edge half-plane Hence Input inside interior intersection point interval tree kd-tree leaf Lemma lies line segments linear program logn mesh Minkowski sum motion planning number of edges number of reported O(log O(n log objects obstacles partition tree pgoal pixel planar point location point q point set polytope priority search tree problem Proof prove pseudodiscs pstart quadtree query algorithm query point query range range queries range searching range tree recursive region road map robot search path search structure Section segment tree set of points shortest path square subtree sweep line Theorem total number trapezoidal map vertex visibility graph Voronoi diagram xmid y-coordinate