| ID | 4493 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Build | cddlib-0.94m-21.fc42 | ||||||||||
| Name | cddlib | ||||||||||
| Version | 0.94m | ||||||||||
| Release | 21.fc42 | ||||||||||
| Epoch | 1 | ||||||||||
| Arch | src | ||||||||||
| Draft | False | ||||||||||
| Summary | A library for generating all vertices in convex polyhedrons | ||||||||||
| Description | The C-library cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities: P = { x=(x1, ..., xd)^T : b - A∙x ≥ 0 } where A is a given m×d real matrix, b is a given m-vector and 0 is the m-vector of all zeros. The program can be used for the reverse operation (i.e. convex hull computation). This means that one can move back and forth between an inequality representation and a generator (i.e. vertex and ray) representation of a polyhedron with cdd. Also, cdd can solve a linear programming problem, i.e. a problem of maximizing and minimizing a linear function over P. | ||||||||||
| Build Time | 2025-03-16 18:49:31 GMT | ||||||||||
| Size | 1.31 MB | ||||||||||
| d047a04c7b98077ecf341c823f9aeea9 | |||||||||||
| License | GPL-2.0-or-later | ||||||||||
| git:https://github.com/cddlib/cddlib.git | |||||||||||
| Provides |
|
||||||||||
| Obsoletes | No Obsoletes | ||||||||||
| Conflicts | No Conflicts | ||||||||||
| Requires |
|
||||||||||
| Recommends | No Recommends | ||||||||||
| Suggests | No Suggests | ||||||||||
| Supplements | No Supplements | ||||||||||
| Enhances | No Enhances | ||||||||||
| Files |
|
||||||||||
| Component of | No Buildroots | ||||||||||
