Array of Voronoi Cells, one per input point; a cell may be null for a coincident point.
Array of Voronoi Edges
Return the nearest Voronoi Site to point [x, y]. If radius is specified, only sites within radius distance are considered. If no Voronoi Site can be found (within the specified radius), null is returned.
x-coordinate
y-coordinate
Optional parameter for search radius around [x, y]
Returns the Delaunay triangulation of the specified data array as an array of links, one for each edge in the mesh. Each link has the following attributes:
Since the triangulation is computed as the dual of the Voronoi diagram, and the Voronoi diagram is clipped by the extent, a subset of the Delaunay links is returned.
Return an array of polygons clipped to the extent, one for each cell in the diagram. Each polygon is represented as an array of points [x, y] where x and y are the point coordinates, and a data field that refers to the corresponding element in data. Polygons are open: they do not contain a closing point that duplicates the first point; a triangle, for example, is an array of three points. Polygons are also counterclockwise, assuming the origin ⟨0,0⟩ is in the top-left corner.
If the cell’s site is coincident with an earlier site, the associated polygon is null.
Returns the Delaunay triangulation of the specified data array as an array of triangles. Each triangle is a three-element array of elements from data. Since the triangulation is computed as the dual of the Voronoi diagram, and the Voronoi diagram is clipped by the extent, a subset of the Delaunay triangulation is returned.
Generated using TypeDoc
Computed Voronoi diagram
The generic refers to the type of the data for the corresponding element.