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.">

rcdd: Computational Geometry (original) (raw)

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.

Version: 1.6
Depends: R (≥ 3.0.2)
Imports: methods
Published: 2023-12-15
DOI: 10.32614/CRAN.package.rcdd
Author: Charles J. Geyer and Glen D. Meeden, incorporates code from cddlib (ver 0.94f) written by Komei Fukuda
Maintainer: Charles J. Geyer
License: GPL-2
URL: https://www.stat.umn.edu/geyer/rcdd/,https://github.com/cjgeyer/rcdd
NeedsCompilation: yes
SystemRequirements: GMP (GNU MP bignum library from https://gmplib.org/)
Materials:
In views: Optimization
CRAN checks: rcdd results

Documentation:

Downloads:

Reverse dependencies:

Reverse depends: CoopGame, mvhist, mvmesh, polyapost
Reverse imports: betapart, blackbox, causaloptim, hitandrun, kantorovich, MCARtest, PlaneGeometry, PLMIX, polyhedralCubature, profExtrema, TML
Reverse suggests: spaMM

Linking:

Please use the canonical formhttps://CRAN.R-project.org/package=rcddto link to this page.