
This table displays a short summary of the properties of the Polyhedron. Note that the number of rays and vertices are modulo the lineality space. So for example a line in QQ^2 has one vertex and no rays. However, one can not access the above information directly, because this is just a virtual hash table generated for the output. The data defining a Polyhedron is extracted by the functions included in this package. A Polyhedron can be constructed as the convex hull (convexHull) of a set of points and a set of rays or as the intersection (polyhedronFromHData) of a set of affine halfspaces and affine hyperplanes.
For example, consider the square and the square with an emerging ray for the convex hull:




If we take the intersection of the halfspaces defined by the directions of the vertices and 1 we get the crosspolytope:




This can for example be embedded in 3space on height 1:





See also Working with polyhedra.
The object Polyhedron is a type, with ancestor classes PolyhedralObject < MutableHashTable < HashTable < Thing.