diff options
| author | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
|---|---|---|
| committer | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
| commit | 4f2d7949f03e1c198bc888f2d05f421d35c57e21 (patch) | |
| tree | ba5f07bf3f9d22d82e54a462313f5d244036c768 /sci-libs/cddlib/metadata.xml | |
reinit the tree, so we can have metadata
Diffstat (limited to 'sci-libs/cddlib/metadata.xml')
| -rw-r--r-- | sci-libs/cddlib/metadata.xml | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/sci-libs/cddlib/metadata.xml b/sci-libs/cddlib/metadata.xml new file mode 100644 index 000000000000..a93a12f9174f --- /dev/null +++ b/sci-libs/cddlib/metadata.xml @@ -0,0 +1,29 @@ +<?xml version="1.0" encoding="UTF-8"?> +<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> +<pkgmetadata> + <maintainer type="project"> + <email>sci-mathematics@gentoo.org</email> + <name>Gentoo Mathematics Project</name> + </maintainer> + <longdescription lang="en"> + 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. + </longdescription> + <use> + <flag name="tools">Add a few executables and tests for cddlib</flag> + </use> +</pkgmetadata> |