Please use 2D Triangle generator repository below

https://github.com/Samson-Mano/2DTriangle_Mesh_Generator

The Constrained Delaunay Triangulation (CDT) algorithm, available at the link below, has been tested for a wide range of cases and has been found to be robust and applicable in many scenarios. 2D triangle mesh generator is one implementation that uses this algorithm.

https://github.com/Samson-Mano/2DTriangle_Mesh_Generator/tree/master/2DTriangle_Mesh_Generator/mesh_control/delaunay_triangulation

Please note that this repository has been superseded by newer versions of the code (link above), and we encourage you to use those instead. However, this repository is still available for reference and can be used if needed.

Constrained Delaunay Triangulation

This is a C# implementation of Constrained Delaunay triangulation. The implementation follows Ruppert’s Algorithm. Bowyer Watson incremental algorithm is used in this implementation

The explaination of algorithm is shown in
https://sites.google.com/site/samsoninfinite/multivariable-calculus/constrained-delaunay-triangulation

Maple Leaf

Example: 1

Example: 2

References

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation Jim Ruppert (NASA Ames Research Center)
https://www.cis.upenn.edu/~cis610/ruppert.pdf

• Delaunay Refinement Algorithms for Triangular Mesh Generation Jonathan Richard Shewchuk jrs@cs.berkeley.edu (May 21, 2001)
https://people.eecs.berkeley.edu/~jrs/papers/2dj.pdf

• Guranteed-Quality Mesh Generation for curved surfaces L.Paul Chew Cornell University Ithaca, NY
https://kogs-www.informatik.uni-hamburg.de/~tchernia/SR_papers/chew93.pdf