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

Triangulate(NodeCoords[, Constraints, ...])	Generate a triangulation for a 2D set of points.
BowyerWatson2d(NodeCoords[, Constraints])	Bowyer-Watson algorithm for 2D Delaunay triangulation
SciPy(NodeCoords[, FixVol])	Wrapper for scipy.spatial.Delaunay for 2D triangulation or 3D tetrahedralization.
Triangle(NodeCoords[, Constraints, steiner])	Interface to Jonathan Shewchuk's Triangle via a python wrapper (https://pypi.org/project/triangle/).
FanTriangulation(NodeCoords[, Hull])	Generate a fan triangulation of a two dimensional convex hull around the points.

Tetrahedralization

Tetrahedralize(NodeCoords[, method, tol])	Generate a Delaunay tetrahedralization for a 3D set of points.
BowyerWatson3d(NodeCoords)	Bowyer-Watson algorithm for 3D Delaunay tetrahedralization [Bow81], [Wat81], [MPR19]

Hulls

ConvexHull(NodeCoords[, method, OrientSurf, nD])	Identify the convex hull of a set of points.
GiftWrapping2d(points[, IncludeCollinear])	Gift wrapping algorithm for computing the convex hull of a set of 2D points.
QuickHull2d(points)	QuickHull algorithm for computing the convex hull of a set of 2D points.
AlphaShape(NodeCoords, alpha[, method, Type])	Alpha shapes in 2D or 3D
Alpha2d(NodeCoords, alpha[, method, Type])	2D Alpha shapes
Alpha3d(NodeCoords, alpha[, method, Type])	3D Alpha shapes
AlphaPeel3d(NodeCoords, alpha[, method, Type])	3D Alpha shapes