A rendition of the triangles as a set of line segments.
Design: LineSegments
The complete Delaunay triangulation. The triangulation is returned as an array of triples of indices into the provided vertices array, such that [0, 1, 2] is the triangle defined by vertices[0], vertices[1], and vertices[2].
Flags : cached
Expression : R.delaunay(this.vertices)
A list of Points to be triangulated. These are assumed to be planar, but no check is performed.
Flags : cached, parameter
Default expression : []
Delaunay (d.1.0.0)
Mixins: BaseAssembly
Computes the Delaunay triangulation [https://en.wikipedia.org/wiki/Delaunay_triangulation] of a planar set of points.