[Bug 464074] New: Review Request: cddlib - A library for generating all vertices in convex polyhedrons
Please do not reply directly to this email. All additional
comments should be made in the comments box of this bug.
Summary: Review Request: cddlib - A library for generating all vertices in convex
polyhedrons
https://bugzilla.redhat.com/show_bug.cgi?id=464074
Summary: Review Request: cddlib - A library for generating all
vertices in convex polyhedrons
Product: Fedora
Version: rawhide
Platform: All
OS/Version: Linux
Status: NEW
Severity: medium
Priority: medium
Component: Package Review
AssignedTo: nobody(a)fedoraproject.org
ReportedBy: konrad(a)tylerc.org
QAContact: extras-qa(a)fedoraproject.org
CC: notting(a)redhat.com, fedora-package-review(a)redhat.com
Estimated Hours: 0.0
Classification: Fedora
Spec URL: http://konradm.fedorapeople.org/fedora/SPECS/cddlib.spec
SRPM URL:
http://konradm.fedorapeople.org/fedora/SRPMS/cddlib-094f-1.fc9.src.rpm
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.
--
Configure bugmail: https://bugzilla.redhat.com/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are on the CC list for the bug.