The dual Delaunay triangulation of the Voronoi diagram.
A method to generate the Voronoi cell corresponding to the point in verts(i).
A method to generate the Voronoi cell corresponding to the point in verts(i). Note that if verts(i) is not distinct, this function may raise an exception.
A method to generate the Voronoi cell corresponding to the point in verts(incidentEdge.vert).
A method to generate the Voronoi cell corresponding to the point in verts(incidentEdge.vert). If the incident edge is not an interior edge (incidentEdge.face == None) the results are undefined.
The polygonal regions of the Voronoi diagram.
The polygonal regions of the Voronoi diagram. There exists one such convex polygon for each distinct vector of verts.
Provides an iterator over the Voronoi cells of the diagram and the points that defined the corresponding polygonal regions.
A class to compute the Voronoi diagram of a set of points. See <geotrellis_home>/docs/vector/voronoi.md for more information.