  |
Computational Geometry: Algorithms and Applications - http://www.cs.ruu.nl/geobook/
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 diagrams, arrangements and duality, Delaunay triangulations, geometric data structures, convex hulls, binary space partitions, robot motion planning, visibility graphs. |
| |
Computational Geometry in C - http://www.cs.smith.edu/~orourke/books/compgeom.html
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. |
| |
CRC Handbook of Discrete and Computational Geometry - http://www.cs.smith.edu/~orourke/books/discrete.html
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. |
| |
Art Gallery Theorems and Algorithms - http://www.cs.smith.edu/~orourke/books/art.html
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. |
| |
Algorithms in Combinatorial Geometry - http://www.springer.com/computer/foundations/book/978-3-540-13722-1
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. |