cddexec_gmp
Programs using libcdd
Install
- All systems
-
curl cmd.cat/cddexec_gmp.sh
- Debian
-
apt-get install libcdd-tools - Ubuntu
-
apt-get install libcdd-tools - Arch Linux
-
pacman -S cddlib - Kali Linux
-
apt-get install libcdd-tools - Fedora
-
dnf install cddlib-tools-1 - Windows (WSL2)
-
sudo apt-get updatesudo apt-get install libcdd-tools - Raspbian
-
apt-get install libcdd-tools - Dockerfile
- dockerfile.run/cddexec_gmp
libcdd-tools
Programs using libcdd
The cddlib library is a C library for manipulating general convex polyhedra. It supports converting between the system of linear inequalities representation and a vertices and extreme rays representation of a polyhedron, and also supports solving linear programming problems. This package contains example programs using libcdd, for example cdd_both_reps, which computes minimal H- and V-representations of a given convex polytope.
cddlib
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 x 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.