Computational Geometry: Algorithms and Applications

Cover
Springer 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.
 

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
5 Unbounded Linear Programs
80
Orthogonal Range Searching
95
Point Location
121
Voronoi Diagrams
147
The Painters Algorithm
251
Getting Where You Want to
267
2 A Point Robot
270
Quadtrees
291
Visibility Graphs
307
Simplex Range Searching
319
Bibliography
341
19
342

Arrangements and Duality
165
9
183
Windowing
211
Mixing Things
235
1
348
2
355
Index
359
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Bibliografische Informationen