Each type is accompanied with alphabetically sorted lists of properties and public methods, both own and inherited from
parent types. The items are links to the detailed descriptions.
Underlined is the default type for this application.
The methods inherited from Poly::Object are described on a separate page, as they are
only needed for advanced scripting.
Convex hull and related algorithms use floating-point arithmetics.
Due to numerical errors inherent to this kind of computations, the resulting
combinatorial description can be arbitrarily far away from the truth, or even
not correspond to any valid polytope. You have been warned.
None of the standard construction clients produces objects of this type.
If you want to get one, create it with the explicit constructor or "re-bless"
an existing RationalPolytope object; the coordinates stored in it don't need
to be converted.
For a finite set of SITESS 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 VoronoiDiagram becomes a derived class from RationalPolytope.
Bounded subcomplex of an unbounded polyhedron, which is associated with a finite metric space.
The tight span is 1-dimensional if and only if the metric is tree-like. In this sense, the tight
span captures the deviation of the metric from a tree-like one.
Polytope propagation means to define a polytope inductively by assigning vectors to arcs
of a directed graph. At each node of such a graph a polytope arises as the joint convex hull
of the polytopes at the translated sources of the inward pointing arcs.