Gentoo Packages

Search

Package Information

Description:

The program cdd+ 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 : A x <= b } where A is an m x d real matrix and b is a real m dimensional vector.

Homepage:

http://www.ifor.math.ethz.ch/~fukuda/cdd_home/

License:

GPL-2

Versions

Metadata

Description

• The program cdd+ 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 : A x <= b } where A is an m x d real matrix and b is a real m dimensional vector.

Maintainers

• Gentoo Mathematics Project (sci-mathematics@gentoo.org) - Type: project

Upstream

• Remote IDs:
  • github: cddlib/cddplus

<pkgmetadata>
	<maintainer type="project">
		<email>sci-mathematics@gentoo.org</email>
		<name>Gentoo Mathematics Project</name>
	</maintainer>
	<longdescription>
	The program cdd+ 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 : A x &lt;= b } where A is an m x d real matrix and b is a real m dimensional vector.
	</longdescription>
	<upstream>
		<remote-id type="github">cddlib/cddplus</remote-id>
	</upstream>
</pkgmetadata>

Lint Warnings

• [Warning] Missing md5-cache for version 077a. Run 'ebuild <ebuild_file> manifest' or 'egencache' to generate it.

Files

• cdd+-077a-gcc-5.patch
• cdd+-077a-gcc11-dynamic-exceptions.patch
• cdd+-077a-gentoo.patch
• cdd+-077a-headers.patch
• cdd+-077a-qa-const-char.patch

Manifest