Computational Geometry In C ) by P. J. O'Rourke

A concise, practical introduction to planar geometric algorithms with concrete C implementations and clear explanations; it presents fundamental primitives and data structures, convex hulls, polygon triangulation and partitioning, line-segment intersection, Voronoi/Delaunay structures, point location and polygon operations, along with algorithm analysis, example code, and implementation tips that emphasize robustness and numerical issues.

Purchase from Bookshop.org