Computational Geometry: Algorithms and ApplicationsSpringer Science & Business Media, 17.04.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 playafundamental 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. |
Inhalt
| 2 | |
| 9 | |
Line Segment Intersection | 19 |
Polygon Triangulation | 45 |
Linear Programming | 63 |
Orthogonal Range Searching | 95 |
4 | 109 |
Point Location | 121 |
5 | 178 |
More Geometric Data Structures | 211 |
Convex Hulls 235 | 234 |
Binary Space Partitions | 251 |
Robot Motion Planning | 267 |
2 A Point Robot | 270 |
Quadtrees | 291 |
Visibility Graphs | 307 |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
1-dimensional associated structure beach line binary search tree boundary BSP tree canonical subsets Chapter circle event computational geometry construct contains convex hull convex polygon coordinate corresponding data structure defined Delaunay triangulation denote diagonal doubly-connected edge list dual event point face facet Figure geometric graph half-edge half-planes Hence horizontal input insert interior intersection point intervals kd-tree leaf Lemma lies LINE SEGMENT INTERSECTION linear program Minkowski sum node number of reported number of vertices O(n² O(nlogn objects overlay P₁ partition tree pixel planar plane sweep point location point q point stored pointer problem Proof prove pstart quadtree query algorithm query point query range range queries range searching range tree recursive region robot S₁ search path search structure Section set of points simple polygon solve split subdivision subtree sweep line Theorem total number trapezoidal map vertical line Vor(P Voronoi diagram y-coordinate
