Computational Geometry in C
by Joseph O'Rourke · Joseph O’Rourke
Implementation-oriented introduction to computational geometry that pairs each algorithm with working C code. Covers polygon triangulation, two- and three-dimensional convex hulls, Voronoi diagrams, arrangements, search and intersection, and motion planning, so readers can both understand and program the core algorithms.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Computational Geometry
Computational Geometry: Algorithms and Applications
Standard textbook on geometric algorithms, with each chapter motivated by a problem from robotics, GIS or graphics. Covers convex hulls, segment intersection, triangulation, linear programming, range searching, point location, Voronoi diagrams and Delaunay triangulations, teaching readers to design and analyse efficient geometric algorithms.
brilliant.org
Brilliant.org is an online, interactive learning platform offering problem-based courses in math and computer science, including topics in automata theory, computation, and discrete mathematics, with guided lessons and practice problems.
Advanced Computational Geometry
In this introductory computer science course, explore geometry, develop geometric thinking, and learn geometric algorithms.