Uploaded July 2025 | Updated November 2026, 2 days ago
Delauney Triangulation is a triangulation of a graph where the triangles are "nice". What does "nice" mean? There are a few different "nice" properties, like a circle through the points of a triangle not containing any other points, and the minimum angle being maximized.
Delabella C++ 2D Delauney Triangulation library: github.com/msokalski/delabella (also contains some links to explanations of the algorithm they use)
Delauney Triangulation Wikipedia page: en.wikipedia.org/wiki/Delaunay_triangulation
Please consider checking out Eclipse Breaker, my upcoming Roguelike: store.steampowered.com/app/2815060/Eclipse_Breaker/?utm_source=youtube&utm_campaign=m4g
Delauney Triangulation is a triangulation of a graph where the triangles are "nice". What does "nice" mean? There are a few different "nice" properties, like a circle through the points of a triangle not containing any other points, and the minimum angle being maximized.
Delabella C++ 2D Delauney Triangulation library: github.com/msokalski/delabella (also contains some links to explanations of the algorithm they use)
Delauney Triangulation Wikipedia page: en.wikipedia.org/wiki/Delaunay_triangulation
Please consider checking out Eclipse Breaker, my upcoming Roguelike: store.steampowered.com/app/2815060/Eclipse_Breaker/?utm_source=youtube&utm_campaign=m4g










