Editing Delaunay triangulation (section)

== External links ==
{{see also|Voronoi diagram#Software}}
* Henry, Ian (July 11, 2022). "[https://ianthehenry.com/posts/delaunay/ Visualizing Delaunay Triangulation]".  Blog post detailing algorithms for Delaunay triangulation.
* Delaunay triangulation in [[CGAL]], the Computational Geometry Algorithms Library:
** [[Mariette Yvinec]]. [http://www.cgal.org/Pkg/Triangulation2 2D Triangulation]. Retrieved April 2010.
** Pion, Sylvain; [[Monique Teillaud|Teillaud, Monique]]. [http://www.cgal.org/Pkg/Triangulation3 3D Triangulations]. Retrieved April 2010.
** Hornus, Samuel; Devillers, Olivier; Jamin, Clément. [http://www.cgal.org/Pkg/Triangulations dD Triangulations]. 
** Hert, Susan; Seel, Michael. [http://www.cgal.org/Pkg/ConvexHullD dD Convex Hulls and Delaunay Triangulations]. Retrieved April 2010. 
* "[https://github.com/greenm01/poly2tri Poly2Tri: Incremental constrained Delaunay triangulation]. Open source C++ implementation. Retrieved April 2019.
* "[https://github.com/eloraiby/delaunay Divide & Conquer Delaunay triangulation construction]". Open source C99 implementation. Retrieved April 2019.
* "[https://github.com/artem-ogre/CDT CDT: Constrained Delaunay Triangulation in C++]". Open source C++ implementation. Retrieved August 2022.

{{DEFAULTSORT:Delaunay Triangulation}}
[[Category:Triangulation (geometry)]]
[[Category:Geometric algorithms]]