Divide and conquer Delaunay triangulation in C.
The following code provides a fast implementation of the 2D Delaunay Triangulation using the divide and conquer approach.
During my second year of Master, at UCLouvain, I followed the Numerical Geometry (LMECA2170) class, given by Professors Vincent Legat and Jean-François Remacle.
At the end of the semester, we were challenged to, in groups of 1 or 2 students, implement one of the algorithms taught in the class, in an efficient and beautiful1 manner.
Finally, I made a YouTube playlist for those who just want to see the code in action, without compiling it locally.