Computational Geometry
Books
This is an incomplete list. If you use any of these books to help you solve homework problems, don't forget to cite them, just like you would any other source.
(B1) Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Computational Geometry: Algorithms and Applications, Springer Verlag 2008.
(B2) Jean-Daniel Boissonnat and Mariette Yvinec, Algorithmic Geometry, Cambridge Univ. Press, 1998.
(B3) Satyan L. Devadoss and Joseph O'Rourke, Discrete and Computational Geometry, Princeton Univ. Press, 2011.
(B4) Herbert Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, 1987.
(B5) Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth (editors), Handbook of Discrete and Computational Geometry, 3rd edition, CRC Press, 2017.
(B6) Sariel Har-Peled, Geometric Approximation Algorithms, AMS Press, 2011.
(B7) Jiří Matoušek, Lectures on Discrete Geometry, Springer, 2002.
(B8) Joseph O'Rourke, Computational Geometry in C, Second Edition, Cambridge Univ. Press, 1998.
(B9) Franco P. Preparata and Michael Ian Shamos, Computational Geometry: An Introduction, Springer, 1985.
(B10) Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge.
Online Resources
Again, this is an incomplete list. I'm deliberately omitting lots of useful Java applets because Java applets are dead. I'm also deliberately omitting thousands of other GitHub repositories because I just don't have time to review/filter them all. I'll add more resources as I discover them.
(R1) A Long list of courses and teaching resources for computational geometry and topology
(R2) Lecture Notes by David Mount
(R3) Video lectures by Philipp Kindermann, for his computational geometry course at the University of Würzburg.
(R4) Javascript demos of several computational geometry algorithms, from Tao Ju ant Washington University in St. Louis
(R6) Lecture notes by Torsten Ueckerdt
(R7) Mapbox Javascript libraries:
Delaunator builds 2D Delaunay triangulations and Voronoi diagrams. Ported into the D3.js visualization library as d3-Delaunay.
Earcut triangulates polygons.