Delaunay Triangulation
Computes the 2D Delaunay triangulation of a set of points.
Node id tessellation/delaunay
The Delaunay Triangulation node computes the 2D Delaunay triangulation of a
collection of points. It decomposes the point set into a mesh of triangular
polygons (triangles) and a set of unique mesh edges (segments).
Inputs
Outputs
Behaviour
- Triangles output.
trianglesreturns an array ofPolygonshapes, one for each triangle in the triangulation. Each triangle polygon's position (transform) is set to its area centroid, and its vertices are relative to that centroid, with consistent counter-clockwise winding. - Segments output.
segmentsreturns an array ofSegmentlines representing all unique edges in the triangulation without duplicates. - Degenerate inputs. Inputs with fewer than 3 points, collinear points, or
exact duplicates produce empty
trianglesandsegmentsoutputs without throwing errors.
Errors
- Non-finite coordinates in any point of
pointsare node errors. - Providing more than 10 000 points is a node error.
Related nodes
- Voronoi: computes dual Voronoi cells from points.
- Relax Points: evens out point distributions using Lloyd relaxation.
- Orthogonal Grid: generates a regular grid of points.
- Polygon: shape type for triangle outputs.
- Segment: line type for mesh edge outputs.