Delaunay#

Delaunay triangulation is a well studied problem, and there are several well-established and commonly used programs for achieving Delaunay triangulations and tetrahedralizations, with and without constraints (constrained Delaunay triangulation, CDT).

The current implementations in mymesh don’t yet meet or exceed the performance or functionality of other available options (though this is an area of active development), so using well established implementations is recommended:

  • qhull (available via scipy.spatial.Delaunay(), or mymesh.delaunay.SciPy()) for n dimensional Delaunay triangulations

  • triangle for 2 dimensional constrained/unconstrained Delaunay triangulations

  • TetGen for 3 dimensional constrained/unconstrained Delaunay triangulations

  • gmsh

  • CGAL

Here you can see a comparison between the performance of mymesh and some alternatives

See also: Delaunay Triangulation, mymesh.delaunay

(Source code)

../_images/delaunay-1.png

This Page