Gentoo Packages

sci-libs/cddlib (gentoo)

Search

Install

Install this package:

emerge -a sci-libs/cddlib

If the package is masked, you can unmask it using the autounmask tool or standard emerge options:

autounmask sci-libs/cddlib

Or alternatively:

emerge --autounmask-write -a sci-libs/cddlib

Package Information

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 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.
Homepage:
https://www.inf.ethz.ch/personal/fukudak/cdd_home/
License:
GPL-2+

Versions

Version EAPI Keywords Slot
094n 8 ~amd64 ~arm ~ppc ~riscv ~x86 0
094m-r2 8 amd64 ~arm ~ppc ~riscv ~x86 0

Metadata

Description

Maintainers

Upstream

Raw Metadata XML 
<pkgmetadata>
	<maintainer type="person">
		<email>mjo@gentoo.org</email>
	</maintainer>
	<maintainer type="person" proxied="yes">
		<email>frp.bissey@gmail.com</email>
		<name>François Bissey</name>
	</maintainer>
	<maintainer type="project" proxied="proxy">
		<email>proxy-maint@gentoo.org</email>
		<name>Proxy Maintainers</name>
	</maintainer>
	<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  &gt;= 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>
	<upstream>
		<remote-id type="github">cddlib/cddlib</remote-id>
	</upstream>
</pkgmetadata>

Lint Warnings

USE Flags

Manage flags for this package: euse -i <flag> -p sci-libs/cddlib | euse -E <flag> -p sci-libs/cddlib | euse -D <flag> -p sci-libs/cddlib

Flag Description 094n 094m-r2
doc Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally ✓ ✓
examples Install examples, usually source code ✓ ✓
static-libs Build static versions of dynamic libraries as well ✓ ✓
tools Add a few executables and tests for cddlib ✓ ✓

Manifest

Type File Size Versions
Unmatched Entries
Type File Size
DIST cddlib-0.94m.tar.gz 1351298 bytes
DIST cddlib-0.94n.tar.gz 1381376 bytes