Available versions of this document: latest release, release 3.5, nightly master
Reference documentation for older polymake versions: release 3.4, release 3.3, release 3.2
BigObject VoronoiPolyhedron<Scalar>
from application polytope
For a finite set of SITES
S the Voronoi region of each site is the set of points closest (with respect to Euclidean distance) to the given site. All Voronoi regions (and their faces) form a polyhedral complex which is a vertical projection of the boundary complex of an unbounded polyhedron P(S). This way VoronoiPolyhedron becomes a derived class from voronoipolyhedron.
 Type Parameters:
Scalar
: inherited fromScalar
 derived from:
Properties
no category

CRUST_GRAPH
Graph of the crust as defined by Amenta, Bern, and Eppstein.
 Type:

DELAUNAY_DIAGRAM
UNDOCUMENTED
 Type:
PolyhedralComplex<Scalar>

DELAUNAY_GRAPH
Graph of the Delaunay decomposition Del(
SITES
). Type:

DELAUNAY_TRIANGULATION
Delaunay triangulation of the sites. (Delaunay subdivision, nonsimplices are triangulated.)
 Type:

ITERATED_DELAUNAY_GRAPH
 Type:

ITERATED_VORONOI_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 theBOUNDING_BOX
. For the default BOUNDING_BOX it may happen that some of the iterated Voronoi vertices are truncated. Create new objects of typeVoronoiPolyhedron
to produce proper iterated Voronoi diagrams. Type:
GeometricGraph<Scalar>

NN_CRUST_GRAPH
Graph of the nearest neighbor crust, as defined in:
T. K. Dey and P. Kumar: A simple provable algorithm for curve reconstruction.
Proc. 10th. Annu. ACMSIAM Sympos. Discrete Alg., 1999, 893894.
Polygonal reconstruction of a smooth planar curve from a finite set of samples. Sampling rate of ⇐ 1/3 suffices.
 Type:

NN_GRAPH
Graph of the nearest neighbors. This is a subgraph of
NN_CRUST_GRAPH
. Type:

N_SITES
Number of
SITES
 Type:

SITES
Homogeneous coordinates of the sites in case the polyhedron is Voronoi. Sites must be pairwise distinct.
 Type:
Matrix<Scalar,NonSymmetric>

SITE_LABELS
Unique names assigned to the
SITES
. Works likeVERTEX_LABELS
. Type:

VORONOI_DIAGRAM
The Voronoi regions as polyhedral complex. Polyhedron indices correspond to site indices.
 Type:
PolyhedralComplex<Scalar>

VORONOI_GRAPH
Graph of the Voronoi diagram of the
SITES
. The homogeneous coordinates after projection are stored as node attributes. The graph is truncated according to the BOUNDING_BOX. All vertices of the Voronoi diagram are visible (and represented in theVORONOI_GRAPH
) for the default BOUNDING_BOX. Type:
GeometricGraph<Scalar>

VORONOI_VERTICES
Vertices of the Voronoi diagram of the
SITES
. Type:
Matrix<Scalar,NonSymmetric>
Methods
Visualization
These methods are for visualization.

VISUAL_CRUST()
Draw a Voronoi diagram, its dual graph and the crust. Use the interactive features of the viewer to select.
 Options:
 option list
Visual::Graph::decorations
 Returns:

VISUAL_NN_CRUST()
Draw a Voronoi diagram, its dual graph and the nearest neighbor crust. Use the interactive features of the viewer to select.
 Options:
 option list
Visual::Graph::decorations
 Returns:

VISUAL_VORONOI()
Visualize the Voronoi diagram together with its sites.
 Options:
 option list
Visual::Polygons::decorations
 Returns: