Package: rcdd 1.6
Charles J. Geyer
rcdd: Computational Geometry
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.
Authors:
rcdd_1.6.tar.gz
rcdd_1.6.tar.gz(r-4.5-noble)rcdd_1.6.tar.gz(r-4.4-noble)
rcdd_1.6.tgz(r-4.4-emscripten)rcdd_1.6.tgz(r-4.3-emscripten)
rcdd.pdf |rcdd.html✨
rcdd/json (API)
# Install 'rcdd' in R: |
install.packages('rcdd', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/cjgeyer/rcdd/issues
Last updated 12 months agofrom:31e2e65782. Checks:OK: 2. Indexed: yes.
Target | Result | Date |
---|---|---|
Doc / Vignettes | OK | Oct 31 2024 |
R-4.5-linux-x86_64 | OK | Oct 31 2024 |
Exports:addHeqaddHinaddVlinesaddVpointsaddVraysallfacesallIntersectallUniond2qlinearitylpcddmakeHmakeVmaximalq2dq2qqabsqdqqgramqinvqmatmultqmaxqminqmqqnegqpqqprodqsignqsumqxqredundantscddvalidcddz2q
Dependencies:
Readme and manuals
Help Manual
Help page | Topics |
---|---|
All Faces of a Convex Polyhedron | allfaces |
GMP Rational Arithmetic | ArithmeticGMP qabs qdq qinv qmatmult qmax qmin qmq qneg qpq qprod qsign qsum qxq |
Convert Between Real, Integer, and GMP Rational | ConvertGMP d2q q2d q2q z2q |
Find implicit linearities in H-representation and V-representation of convex polyhedron | linearity |
linear programming with exact arithmetic | lpcdd |
make H-representation of convex polyhedron | addHeq addHin makeH |
make V-representation of convex polyhedron | addVlines addVpoints addVrays makeV |
GMP Rational Gram-Schmidt | qgram |
Eliminate redundant rows of H-representation and V-representation | redundant |
Go between H-representation and V-representation of convex polyhedron | scdd |
subsets and maximal sets | all.intersect all.union allIntersect allUnion maximal |
validate an H-representation or V-representation of convex polyhedron | validcdd |