Links to software for polyhedral computation:
- azove is Markus
for counting (without explicit enumeration) and enumeration of
vertices of a polytope.
and library implementing the Double
Description Method of Motzkin et al.
counting and detecting lattice points inside convex polytopes,
solution of integer programs by Jesus De Loera et al.
- pd: A
primal-dual method for vertex enumeration by David Bremner,
Fukuda and Ambros
(POlyhedron Representation Transformation Algorithm): a
routines for analyzing polytopes and polyhedra implemented by
Christof and Andreas Löbel.
a versatile tool for the algorithmic treatment of polytopes and
Polka: a library to handle convex polyhedra by Bertrand
the successor of the library by Wilde and Le Verge.
- PPL: The
Parma Polyhedra Library (PPL) is a modern C++ library providing
numerical abstractions especially targeted at applications in
of analysis and verification of complex systems written by a
small team .
- Qhull: Computes the convex
hull, Delaunay triangulation, Voronoi diagram, etc. in
2-d, 3-d, 4-d, and higher dimensions.
A callable function library to solve linear programming
written by David
Dash, and Monika
is Nikolai Zolotykh's impementation of the double description
in float, integer and arbitrary precision integer arithmetic.
by Thomas Rehn and Achill Schürmann is a C++ tool for
description conversion up to a given or computed symmetry
by Rahul Savani is a free web interface to lrsnash
back to lrs homepage