Bug#454469: ITP: lrslib -- enumerate vertices and extreme rays of a convex polyhedron
Package: wnpp
Severity: wishlist
Owner: David Bremner <bremner@unb.ca>
* Package name : lrslib
Version : 4.2b
Upstream Author : David Avis <avis@cs.mcgill.ca>
* URL : http://cgm.cs.mcgill.ca/~avis/C/lrs.html
* License : GPL 2+
Programming Lang: C
Description : Enumerate vertices and extreme rays of a convex polyhedron
A convex polyhedron is the set of points satisfying a finite family of linear
inequalities. The study of the vertices and extreme rays of such systems is important
and useful in e.g. mathematics and optimization. In a dual interpretation, finding the
vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding
inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search)
has two important features that can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no matter how large the
output is.
-- System Information:
Debian Release: lenny/sid
APT prefers unstable
APT policy: (500, 'unstable'), (500, 'testing')
Architecture: i386 (i686)
Kernel: Linux 2.6.22 (SMP w/2 CPU cores)
Locale: LANG=en_CA.UTF-8, LC_CTYPE=en_CA.UTF-8 (charmap=UTF-8)
Shell: /bin/sh linked to /bin/bash
Reply to: