Computational Geometry
All Faces of a Convex Polyhedron
GMP Rational Arithmetic
Convert Between Real, Integer, and GMP Rational
Find implicit linearities in H-representation and V-representation of ...
linear programming with exact arithmetic
make H-representation of convex polyhedron
make V-representation of convex polyhedron
GMP Rational Gram-Schmidt
Eliminate redundant rows of H-representation and V-representation
Go between H-representation and V-representation of convex polyhedron
subsets and maximal sets
validate an H-representation or V-representation of convex polyhedron
R interface to (some of) cddlib (<https://github.com/cddlib/cddlib>). Converts back and forth between two representations of a convex polytope: as solution of a set of linear equalities and inequalities and as convex hull of set of points and rays. Also does linear programming and redundant generator elimination (for example, convex hull in n dimensions). All functions can use exact infinite-precision rational arithmetic.