Computational Geometry: Algorithms and Applications

Portada
Springer Science & Business Media, 7 mar 2008 - 386 páginas
Computational 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.
 

Páginas seleccionadas

Índice

Computational Geometry
3
28035
18
5
35
4
57
2
66
Orthogonal Range Searching
95
4
109
Point Location
121
4
201
7
215
Convex Hulls
244
Binary Space Partitions
259
Robot Motion Planning
283
Quadtrees
307
64
319
Visibility Graphs
323

6
144
3
153
4
163
6
170
2
177
Delaunay Triangulations
191
Simplex Range Searching
335
Bibliography
357
71
360
Index
377
Página de créditos

Otras ediciones - Ver todo

Términos y frases comunes

Pasajes populares

Página 365 - P. Erdos, L. Lovasz, A. Simmons, and E. Straus. Dissection graphs of planar point sets. In JN Srivastava, editor, A Survey of Combinatorial Theory, pages 139-154. North-Holland, Amsterdam, Netherlands, 1973.

Información bibliográfica