Codes for Polytope and Polyhedron Problems

CDD
     K. Fukuda's code for generating all vertices and extreme rays of a general
     convex polyhedron, based on the Double Description method of Motzkin et al.

dda.tar.Z
     Double Description Algorithm for calculating a basis of the lineality space and
     the extreme rays of a polyhedral cone, see E. Burger, Über homogene lineare
     Ungleichungssysteme, Zeitschrift für Angewandte Mathematik und Mechanik
     26 (1956), 135-139, and modified by Padberg, see M. Padberg, Linear
     Programming: Lecture Notes, New York University, New York, April 1993.

 readme  - Information on source files and producing executable by authors 
                D. Alevras, G. Cramer, M. Padberg

lrs
     Code for generating all vertices of a polytope based on the reverse search
     algorithm of Avis / Fukuda

Poly FAQ
     Summary (basic definitions, properties, and problems) on polyhedra,
     polytopes, Voronoi diagrams and Delauny triangulations cast into a
     Frequently Asked Questions Web page, by K Fukuda

PolyLib
     Library of polyhedral functions providing code for solving systems of mixed
     linear inequalities and equations based on the Chernikova algorithm, see
     N.V. Chernikova, Algorithm for Finding a General Formula for the Non-
     Negative Solutions of a System of Linear Inequalities, USSR Computational
     Mathematics and Mathematical Physics 5(2) (1965), 228-233, first
     implementation by D. Wilde (IRISA / Université de Rennes I)

Polymake
     Tool for the algorithmic treatment of polytopes and polyhedra and finite
     simplicial complexes by E. Gawrilow and M. Joswig (Technische Universität
     Berlin)

PORTA
     Collection of routines for analyzing polytopes and polyhedra represented
     as a system of linear equations and inequalities or by a set of points and
     vectors and transformation of one representation into the other, by
     T. Christof (Universität Heidelberg) and A. Löbel (ZIB)

TOPCOM
     Package for computing triangulations of point configurations and oriented
     matroids by J. Rambau (ZIB).

Vclip
     Collision detection library providing a C++ implementation of the Voronoi
     Clip collision detection algorithm for polyhedral objects by B. Mirtich

Zerone
     Vertex enumeration code for 0/1 polytopes by M.R. Bussieck and
     M.E. Lübbecke

Qhull
     Program package for computing convex hulls, Delauny triangulations,
     Voronoi diagrams, halfspace intersections about a point, furthest-site
     Delaunay triangulations, and furthest-site Voronoi diagrams, by
     C.B. Barber and H.T. Huhdanpaa