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
• 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 [email protected] (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