Main Content

Delaunay Triangulation

Represent and interact with Delaunay triangulations

A Delaunay triangulation is a type of triangulation that reduces the number of narrow triangles and does not depend on vertex ordering. You can create a Delaunay triangulation with the delaunay and delaunayn functions, or create a delaunayTriangulation object that has object functions for computing geometric quantities. You can visualize the triangulation and work with STL files to write triangulation data.


expand all

delaunayDelaunay triangulation
delaunaynN-D Delaunay triangulation
delaunayTriangulationDelaunay triangulation in 2-D and 3-D
convexHullConvex hull of Delaunay triangulation
isInterior Query points inside Delaunay triangulation
voronoiDiagramVoronoi diagram of Delaunay triangulation
barycentricToCartesianConvert coordinates from barycentric to Cartesian
cartesianToBarycentricConvert coordinates from Cartesian to barycentric
circumcenterCircumcenter of triangle or tetrahedron
edgeAttachmentsTriangles or tetrahedra attached to specified edge
edgesTriangulation edges
faceNormalTriangulation unit normal vectors
featureEdgesSharp edges of surface triangulation
freeBoundaryFree boundary facets
incenterIncenter of triangulation elements
isConnectedTest if two vertices are connected by an edge
nearestNeighborVertex closest to specified point
neighborsTriangle or tetrahedron neighbors
pointLocationTriangle or tetrahedron enclosing point
sizeSize of triangulation connectivity list
vertexAttachmentsTriangles or tetrahedra attached to vertex
vertexNormalTriangulation vertex normal
boundaryshapeCreate polyshape from 2-D triangulation
stlwriteCreate STL file from triangulation
tetrameshTetrahedron mesh plot
trimeshTriangular mesh plot
triplot2-D triangular plot
trisurfTriangular surface plot