Post

Delaunay Triangulation

Posted
By Jérome Eertmans 1 min read

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.

Story

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.

Because I really enjoyed this project, I went a bit further and created a nice user interface with sounds2. The code is fully open source and should very run in a few commands.

Finally, I made a YouTube playlist for those who just want to see the code in action, without compiling it locally.

  1. A 2D graphic library was provided and creating a nice user interface was a bonus. ↩

  2. I really recommend you to try the YOUPIDOU mode! ↩

This post is licensed under CC BY 4.0 by the author.