GMP (GNU MP bignum library from
<http://gmplib.org/>)
R interface to (some of) cddlib
(<http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html>).
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.

Charles J. Geyer <charlie@stat.umn.edu> and Glen D. Meeden
<glen@stat.umn.edu>, incorporates code from cddlib (ver 0.94f)
written by Komei Fukuda <fukuda@ifor.math.ethz.ch>
R interface to (some of) cddlib, see
http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html 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 with exact
infinite-precision rational arithmetic.

R interface to (some of) cddlib
(http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html).
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.

R interface to (some of) cddlib
(http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html).
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.

GMP (GNU MP bignum library from
<https://gmplib.org/>)
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.