Computational Geometry: Fundamental Structures*
Mark de Berg
Eindhoven University of Technology
Bettina Speckmann
Eindhoven University of Technology
Substructures and Complexity•Decomposition•Duality
Complexity•Construction•Dynamic Convex Hulls
Complexity•Construction•Variations
Delaunay Triangulation•Polygons•Polyhedra•Pseudo-Triangulations
Computational geometry deals with the design and analysis of algorithms and data structures for problems involving spatial data. The questions that are studied range from basic problems such as line-segment intersection (“Compute all intersection points in a given set of line segments ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
