The passed triangle array must contain an ordered sequence of adjacent triangles.
This is the 'center' of the voronoi cell; all triangles must share that vertex.
Check if the first and the last triangle in the path are NOT connected.
Convert the voronoi cell path data to an array.
[vertex0, vertex1, vertex2, ... ]
Convert the voronoi cell path data to an SVG polygon data string.
"x0,y0 x1,y1 x2,y2 ..."
Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points.
Note that open Voronoi cell cannot properly converted to Polygons as they are considered infinite. 'Open' Voronoi edges will be cut off at their innermose vertices.
Generated using TypeDoc
The constructor.
VoronoiCell