rcdd (Q20196): Difference between revisions
From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/rcdd, #quickstatements; #temporary_batch_1711027662947 |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
| Property / Software Heritage ID | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:c3568ad3d1b062a09a49fc645d2b2303b2bffc20 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:c3568ad3d1b062a09a49fc645d2b2303b2bffc20 / qualifier | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:c3568ad3d1b062a09a49fc645d2b2303b2bffc20 / qualifier | |||||||||||||||
point in time: 13 January 2024
| |||||||||||||||
Latest revision as of 15:32, 21 March 2024
Computational Geometry
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | rcdd |
Computational Geometry |
Statements
15 December 2023
0 references
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.
0 references
