This is a C# implementation of Divide and conquer Delaunay triangulation. The implementation follows Guibas and Stolfi’s paper. This is the vertical cut implementation of divide and conquer.
mesh
mesh-generation
divide
delaunay-triangulation
divide-and-conquer
conquer-algorithm
delaunay-triangulator
divide-and-conquer-division
guibas
vertical-cuts
lr-edge
-
Updated
Jan 30, 2024 - C#