An algorithm for describing polyhedrons

A polyhedron can be described by a list of inequalities or by a list of its vertices and extreme rays. The lrs program converts a H-representation of a polyhedron to its V-representation, and vice versa. These problems are known respectively at the vertex enumeration and convex hull problems.

There are run-time dependencies that need to be installed first. Why not use depothelper to install them all in one go?

Run-time dependencies:
Build-time dependencies:
gcc gmp make            
Operating System Architecture Package Type Package Size Date Archived View Contents? Download
HP-UX 11.00
32-bit PA-RISC 1.1Gzipped
Binary Depot
114 K17 Sep 2001YesHTTP FTP
HP-UX -Tarred/Gzipped
Source Code
167 K17 Sep 2001YesHTTP FTP