Computational Geometry: Algorithms and ApplicationsComputational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld 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 information 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 dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern 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. |
Contents
| 2 | |
2 Line Segment Intersection | 19 |
3 Polygon Triangulation | 45 |
4 Linear Programming | 63 |
5 Orthogonal Range Searching | 95 |
6 Point Location | 121 |
7 Voronoi Diagrams | 147 |
8 Arrangements and Duality | 173 |
11 Convex Hulls | 243 |
12 Binary Space Partitions | 259 |
13 Robot Motion Planning | 283 |
14 Quadtrees | 307 |
15 Visibility Graphs | 323 |
16 Simplex Range Searching | 335 |
| 357 | |
| 377 | |
Other editions - View all
Common terms and phrases
3-dimensional associated structure beach line bound boundary BSP tree canonical subsets Chapter computational geometry configuration space construct contains convex hull convex polygon corresponding data structure defined Delaunay triangulation denote diagonal disc disjoint doubly-connected edge list endpoint event point face facets Figure geometric graph half-edge half-planes Hence input inside interior intersection point interval tree kd-tree leaf Lemma lies LINE SEGMENT INTERSECTION line segments linear program mesh Minkowski sum motion planning number of reported O(nlogn objects obstacles partition tree planar plane sweep point location point q pointer problem prove pseudodiscs pstart quadtree query algorithm query point query range random range queries range searching range tree recursive region robot search path search structure Section SEGMENT INTERSECTION segment tree set of points shortest path simple polygon square subdivision subtree sweep line Theorem total number trapezoidal map vertex Vor(P Voronoi diagram y-coordinate