| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: cdd | Distribution: OpenMandriva Lx |
| Version: 094g | Vendor: OpenMandriva |
| Release: 3 | Build date: Tue May 21 00:25:05 2019 |
| Group: Sciences/Mathematics | Build host: 10cores-8.openmandriva.org |
| Size: 315320 | Source RPM: cdd-094g-3.src.rpm |
| Packager: bero <bero@lindev.ch> | |
| Url: http://www.ifor.math.ethz.ch/~fukuda/cdd_home/index.html | |
| Summary: A library for generating all vertices in convex polyhedrons | |
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.
GPLv2+
/usr/bin/adjacency /usr/bin/adjacency_gmp /usr/bin/allfaces /usr/bin/allfaces_gmp /usr/bin/cdd_both_reps /usr/bin/cdd_both_reps_gmp /usr/bin/fourier /usr/bin/fourier_gmp /usr/bin/lcdd /usr/bin/lcdd_gmp /usr/bin/projection /usr/bin/projection_gmp /usr/bin/redcheck /usr/bin/redcheck_gmp /usr/bin/scdd /usr/bin/scdd_gmp /usr/bin/testcdd1 /usr/bin/testcdd1_gmp /usr/bin/testcdd2 /usr/bin/testcdd2_gmp /usr/bin/testlp1 /usr/bin/testlp1_gmp /usr/bin/testlp2 /usr/bin/testlp2_gmp /usr/bin/testlp3 /usr/bin/testlp3_gmp /usr/bin/testshoot /usr/bin/testshoot_gmp
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Feb 11 23:04:04 2025