C# Delaunay triangulation + Voronoi Diagram

A C# implementation of the Bowyer–Watson algorithm. The result is a Delaunay triangulation for a set of randomly generated points. Following the Delaunay triangulation, the dual Voronoi diagram is constructed.

A screenshot of the Delaunay triangulation and the Voronoi diagram for 5000 points.

Why C#?

It just looks good. Also, blog posts listed below talking about procedural content and map generation caught my eye. Since my intention is to port the algorithms to the Unity game engine for future projects, I decided to stick to C#, as it is Unity's scripting language of choice.

License

This project is licensed under the MIT License - see the LICENSE.txt file for details

Acknowledgments

• Procedural Dungeon Generation Algorithm
• Polygonal Map Generation for Games
• Check if point is in circumcircle of a triangle (TitohuanT's answer)