Go backward to 1 IntroductionGo up to Main PageGo forward to 3 Combinatorial Structure |
XHTML 1.0 |

In this section problems are collected whose input are geometrical
data, i.e., the *H*- or *V*-description of a
polytope. Some problems which are also given by geometrical data
appear in Sections 4 and 5.

Relevant information on the subjects of this section may also be found at Komei Fukuda's page on Frequently Asked Questions in Polyhedral Computation.

- 1 Vertex Enumeration
- 2 Facet Enumeration
- 3 Polytope Verification
- 4 Polytope Containment
- 5 Face Lattice of Geometric Polytopes
- 6 Degeneracy Testing
- 7 Number of Vertices
- 8 Feasible Basis Extension
- 9 Recognizing Integer Polyhedra
- 10 Diameter
- 11 Minimum Triangulation
- 12 Volume
- 13 Largest/Smallest
*j*-Simplex

Why are some symbols not displayed correctly? |