Computational Geometry: Algorithms and Applications

This book by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars is a standard introduction to computational geometry. It develops the main techniques for geometric algorithms — line segment intersection, convex hulls, Voronoi diagrams, Delaunay triangulations, point location, range searching, and so on — in the framework of randomized incremental algorithms and divide and conquer.

Download Book