Computational Geometry by Mark de Berg
Algorithms and Applications
A concise, algorithm-focused introduction to the core problems, data structures and techniques of computational geometry, covering planar topics such as convex hulls, line-segment intersection, polygon triangulation, Voronoi diagrams and Delaunay triangulations, range searching, point location and arrangements; it emphasizes algorithm design paradigms (sweep-line, divide-and-conquer, incremental), complexity analysis, implementation issues and practical applications in graphics, GIS and robotics, and includes proofs, examples and exercises to bridge theory and practice.
Purchase from
Bookshop.org
- Published
- 1997
- Nationality
- British
- Length
- Unknown
- Pages
- Unknown
- Original Language
- English
- Avg User Rating
-
(4.0)
- Alternate Titles
- - Computational Geometry
This book is not currently on any lists.