Constrained triangulation of 2D point sets

This is my class project for cs294 #5 from Prof. Jonathan Shewchuk - Triangulation & Meshing. I implemented 4 different Delaunay triangulation algorithms:

• Guibas & Stolfi’s divide and conquer with vertical splits
• Guibas & Stolfi’s divide and conquer with alternating splits
• Incremental delaunay triangulation (randomized)
• Gift wrapping

The idea of the project was to compete against triangle - Jonathan’s amazing triangulation library. Needless to say, I was not able to beat triangle, but I learned a lot on floating point precision issues as well as performance tricks.