mymesh.delaunay#
Delaunay triangulation and related methods
Currently this module consists of several basic implementations of algorithms related to Delaunay triangulation, as well as interfaces to Delaunay triangulation with SciPy (which uses QHull) and Jonathan Shewchuk’s Triangle. Further development with improved Delaunay triangulation and tetrahedralization capabilities are planned for the future.
Triangulation#
|
Generate a triangulation for a 2D set of points. |
|
Bowyer-Watson algorithm for 2D Delaunay triangulation |
|
Wrapper for |
|
Interface to Jonathan Shewchuk's Triangle via a python wrapper (https://pypi.org/project/triangle/). |
|
Generate a fan triangulation of a two dimensional convex hull around the points. |
Tetrahedralization#
|
Generate a Delaunay tetrahedralization for a 3D set of points. |
|
Bowyer-Watson algorithm for 3D Delaunay tetrahedralization [Bow81], [Wat81], [MPR19] |
Hulls#
|
Identify the convex hull of a set of points. |
|
Alpha shapes in 2D or 3D |
|
2D Alpha shapes |
|
3D Alpha shapes |
|
3D Alpha shapes |
|
Gift wrapping algorithm for computing the convex hull of a set of 2D points. |