lrs home page McGill

 lrslib is a self-contained ANSI C implementation of the reverse search algorithm for  vertex enumeration/convex hull problems. Version 4.1 is implemented as a callable library and comes with two main driver programs: lrs and redund, a set of demo drivers suitable for customization, and a choice of three arithmetic packages. Input file formats are compatible with Komei Fukuda's cdd package. An input file consists of either an H-representation (half-space description) or V-representation (vertex/ray description) of a convex polyhedron, which need not be of full dimension. Linearities, respectively hyperplanes or lines,  are allowed in either description. All computations are done exactly in either multiple  precision or fixed integer arithmetic. Output is not stored in memory, so even problems with very large output sizes can sometimes be solved. The program is intended for Unix/Linux platforms, but Win98 binaries are also provided, caveat emptor. The old workhorse lrs3.2a is still available, but no longer maintained.
Documentation: User's Guide.    lrslib Guide.   Theoretical Description.    Computational Results.        Download     Testdrive.
Functions of lrs:

Functions of redund: Libraries: Demos: Links to related software

David Avis     
Computer Science, McGill University, 3480 University, Montreal , Quebec, Canada H3A 2A7 

last update: 2004.8.24