Jump to letter: [
0349ABCDEFGHIJKLMNOPQRSTUVWXYZ
]
cddlib  A library for generating all vertices in convex polyhedrons
 Description:
The Clibrary 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 x d real matrix, b is a given mvector
and 0 is the mvector 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.
Packages
cddlib0.94j4.fc14.al.src
[1.3 MiB] 
Changelog
by Jerry James (20190924):
 Drop cdd_both_reps.c and accompanying patch, replaced with cddexec
