## Voronoi diagrams

SITES : matrix
Coordinates of the sites in case the polyhedron is Voronoi. Sites must be distinct.
N_SITES : cardinal
Number of SITES.
SITE_LABELS : array<label>
Unique names assigned to the SITES. Works like VERTEX_LABELS.
VORONOI_BOUNDING_BOX : matrix
Since a Voronoi polyhedron is unbounded it must be artificially bounded for visualization purposes. Allowed is any set of hyperplanes which makes the projection onto the last d-1 coordinates bounded. By default, these are the vertical facets of a suitably scaled cube. Not very useful for other unbounded polyhedra not related to Voronoi diagrams.
VORONOI_VERTICES : matrix
Vertices of the Voronoi diagram of the SITES.
VORONOI_GRAPH : graph
Graph of the Voronoi diagram of the SITES. The coordinates (homogeneous, before projection) are stored as node attributes. The graph is truncated according to the VORONOI_BOUNDING_BOX. All vertices of the Voronoi diagram are visible (and represented in the VORONOI_GRAPH) for the default VORONOI_BOUNDING_BOX.
DELAUNAY_GRAPH : graph
Graph of the Delaunay decomposition Del(SITES).
ITERATED_DELAUNAY_GRAPH : graph
Graph of the Del(SITES) + Vor(SITES).
CRUST_GRAPH : graph
Graph of the crust as defined by Amenta, Bern, and Eppstein.
NN_CRUST_GRAPH : graph
Graph of the nearest neighbor crust, as defined by Dey and Kumar.
NN_GRAPH : graph
Graph of the nearest neighbors. This is a subgraph of NN_CRIST_GRAPH.
ITERATED_VORONOI_GRAPH : graph
Graph of the joint Voronoi diagram of the SITES and the vertices of Vor(SITES). The coordinates (homogeneous, before projection) are stored as node attributes. The graph is truncated according to the VORONOI_BOUNDING_BOX. For the default VORONOI_BOUNDING_BOX it may happen that some of the iterated Voronoi vertices are truncated. Use the client voronoi to produce proper iterated Voronoi diagrams.

## Properties inherited from parent classes

See also property descriptions for RationalPolytope, Polytope