Computational Geometry: Algorithms and Applications

Cover
Springer Science & Business Media, 07.03.2008 - 386 Seiten
0 Rezensionen
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.
 

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Inhalt

Computational Geometry
2
Line Segment Intersection
19
Polygon Triangulation
45
Linear Programming
63
Orthogonal Range Searching
95
4
102
7
109
Point Location
121
4
180
Delaunay Triangulations
191
More Geometric Data Structures
219
Convex Hulls
243
Binary Space Partitions
259
Robot Motion Planning
283
Quadtrees
307
Visibility Graphs
323

5
127
Voronoi Diagrams
147
6
153
Arrangements and Duality
173
Simplex Range Searching
335
19
357
Index
377
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Bibliografische Informationen