| 1. | 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.
www.springer.de |
| 2. | Computational Geometry: An Introduction | | | One of the well-known early textbooks, by Franco P. Preparata and Michael Ian Shamos. Includes chapters on geometric searching, convex hulls, proximity, intersections, and rectangles.
www.springer.de |
| | |