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?
|Operating System||Architecture||Package Type||Package Size||Date Archived||View Contents?||Download|
|32-bit PA-RISC 1.1||Gzipped|
|114 K||17 Sep 2001||Yes||HTTP FTP|
|167 K||17 Sep 2001||Yes||HTTP FTP|