`DelaunayTri`

Legacy class that builds and stores the Delaunay triangulation of a point set.

Category: Mathematics > Computational Geometry

Syntax

DT = DelaunayTri(x, y)

Triangulation of 2-D points.

DT = DelaunayTri(x, y, z)

Triangulation of 3-D points.

DT = DelaunayTri(P)

Points as the rows of a matrix.

Description

DelaunayTri is the older interface to Delaunay triangulation, superseded by delaunayTriangulation. Its methods have plural or abbreviated names such as circumcenters, incenters, faceNormals, cartToBary, baryToCart, isEdge, inOutStatus, nearestNeighbor and pointLocation.

Use it when maintaining older code; otherwise choose delaunayTriangulation.

Input arguments

x, y, z: Coordinates of the points, as column vectors.
P: Matrix with one point per row.

Output arguments

DT: A DelaunayTri object with properties X (the points), Triangulation (the connectivity) and Constraints.

Example

Create and inspect

x = [0 1 1 0 0.5]';
y = [0 0 1 1 0.5]';
DL = DelaunayTri(x, y);
DL.Triangulation
isEdge(DL, [1 2], [2 3])

Output

ans = 4×3

     5     2     3
     1     2     5
     5     4     1
     3     4     5
ans = 2×1 logical array

   1
   1

Notes

Constrained triangulations (the Constraints input) are not supported in MatLivre.

DelaunayTri