Algorithmic Geometry

The book covers the theoretical background and analysis of algorithms in computational geometry, their implementation details, and their applications.^[1] It is grouped into five sections, the first of which covers background material on the design and analysis of algorithms and data structures, including computational complexity theory, and techniques for designing randomized algorithms. Its subsequent sections each consist of a chapter on the mathematics of a subtopic in this area, presented at the level of detail needed to analyze the algorithms, followed by two or three chapters on algorithms for that subtopic.^[2]

The topics presented in these sections and chapters include convex hulls and convex hull algorithms, low-dimensional randomized linear programming, point set triangulation for two- and three-dimensional data, arrangements of hyperplanes, of line segments, and of triangles, Voronoi diagrams, and Delaunay triangulations.^[2][3]

The book can be used as a graduate textbook, or as a reference for computational geometry research.^[1] Reviewer Peter McMullen calls it "a welcome addition to the shelves of anyone interested in algorithmic geometry".^[2]