Links to software for polyhedral computation:                            

• azove is Markus Behle's tool for counting (without explicit enumeration) and enumeration of 0/1 vertices of a polytope.
• dd/cdd+/cddlib: Komei Fukuda's programs and library implementing the Double Description Method of Motzkin et al.
• LattE: counting and detecting lattice points inside convex polytopes, and the solution of integer programs by Jesus De Loera et al.
  
• pd: A primal-dual method for vertex enumeration by David Bremner, Komei Fukuda and Ambros Marzetta.
• PORTA (POlyhedron Representation Transformation Algorithm): a collection of routines for analyzing polytopes and polyhedra implemented by Thomas Christof and Andreas Löbel.
• Polymake: a versatile tool for the algorithmic treatment of polytopes and polyhedra.
• Polylib: a library of polyhedral functions by Doran Wilde and Hervé Le Verge.
• New Polka: a library to handle convex polyhedra by Bertrand Jeannet. 
• PolyLib: 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 the field 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.
• Qsopt  A callable function library to solve linear programming problems written by David Applegate, William Cook, Sanjeeb Dash, and Monika Mevenkamp.
  
• Skeleton2 is Nikolai Zolotykh's impementation of the double description method, in float, integer and arbitrary precision integer arithmetic.