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

NameTypeDefaultNotes
pointsArray<Point>—

Outputs

NameTypeNotes
trianglesArray<Polygon>
segmentsArray<Segment>

Behaviour

  • Triangles output. triangles returns an array of Polygon shapes, 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. segments returns an array of Segment lines representing all unique edges in the triangulation without duplicates.
  • Degenerate inputs. Inputs with fewer than 3 points, collinear points, or exact duplicates produce empty triangles and segments outputs without throwing errors.

Errors

  • Non-finite coordinates in any point of points are node errors.
  • Providing more than 10 000 points is a node error.
  • 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.
© 2026 Wirepaint