Converx Hull Problem and Solving Systems of Linear Inequalities
Because the original skeleton package has not been updated for a quite long time. And I found it can not been compiled under Linux system because of two bugs. Thus I fixed the bugs and re-distribution the code here.
For more information, please read http://www.uic.unn.ru/~zny/skeleton/. Skeleton is a new fast implementation of Double Description Method (DDM) [1] for generating all extreme rays of a polyhedral cone and, consequently, for solving the vertex and facet enumeration problems for convex polyhedra. Using Skeleton you can solve convex hull problem in d-dimensinal space. Also, you can find all solutions to a system of linear inequalities. New enhancements [2] make Skeleton very competitive in comparison with other implementations of DDM and other methods for solving these problems.
Float, integer and arbitrary precision integer arithmetics is supported. The implementation uses Arageli library for exact computation.
Please cite [2] in your publication if you use Skeleton.
A descendant of Skeleton is S. Bastrakov's qskeleton that uses a lot of new enchancements [3]. We note that not all features of skeleton is supported in qskeleton.