Computational Geometry

R interface to (some of) 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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.5 by Charles J. Geyer, 9 days ago,

Browse source code at

Authors: Charles J. Geyer <[email protected]> and Glen D. Meeden <[email protected]> , incorporates code from cddlib (ver 0.94f) written by Komei Fukuda <[email protected]>

Documentation:   PDF Manual  

Task views: Optimization and Mathematical Programming

GPL-2 license

Imports methods

System requirements: GMP (GNU MP bignum library from <>)

Imported by PLMIX, betapart, blackbox, causaloptim, gfilogisreg, hitandrun, kantorovich, profExtrema.

Depended on by CoopGame, mvmesh, polyapost.

Suggested by spaMM.

See at CRAN