Sites:
| 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. | | 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. | | 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. | | 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 diagrams, arrangements and duality, Delaunay triangulations, geometric data structures, convex hulls, binary space partitions, robot motion planning, visibility graphs. | | 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. |
|
Classical
