Algorithms in Combinatorial Geometry
- One of the well-known early textbooks, by Herbert Edelsbrunner. Includes chapters on arrangements, convex hulls, linear programming, planar point location, Voronoi diagrams, and separation and intersection.
- http://www.springer.com/east/home?SGWID=5-102-22-1240007-0

CRC Handbook of Discrete and Computational Geometry
- Comprehensive handbook, edited by Jacob E. Goodman and Joseph O'Rourke, with 52 chapters in its first edition and 65 chapters in its second edition.
- http://www.cs.smith.edu/~orourke/books/discrete.html

Computational Geometry in C
- A well-known textbook by Joseph O'Rourke, including chapters on polygon triangulation, polygon partitioning, convex hulls in 2D and 3D, Voronoi diagrams, arrangements, search and intersection, and motion planning. Sample code in C and Java.
- http://www.cs.smith.edu/~orourke/books/compgeom.html

Art Gallery Theorems and Algorithms
- By Joseph O'Rourke. Survey and description of the work in guarding "art galleries" and their generalizations, up until the date of publication (1987). Written for a general mathematical audience.
- http://www.cs.smith.edu/~orourke/books/art.html

Computational Geometry: Algorithms and Applications
- Recent book with a focus on applications, by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Includes chapters on line-segment intersection, polygon triangulation, linear programming, range searching, point location, Voronoi diagr
- http://www.cs.ruu.nl/geobook/