PolyLib - A library of polyhedral functions

What's new:

The Polyhedral Library (PolyLib for short) operates on objects made up of unions of polyhedra of any dimension. It was first developed by Doran Wilde at IRISA, in Rennes, France, in connection with the ALPHA project. This first version (1.1) manipulates non parameterized unions of polyhedra through the following operations: intersection, difference, union, convex hull, simplify, image and preimage, plus some input and output functions. The polyhedra are computed in their dual implicit and Minkowski representations, in homogeneous spaces.

Version 2 of the PolyLib included parameterized vertices computation. PolyLib3.14 includes Ehrhart polynomials computation, which permits to count the number of integer points contained in a parameterized polyhedron. PolyLib4 included the GNU MP library (as a compilation option), and 64 bits computations, in order to avoid integer overflows. Polylib5 is a merge of Strasbourg, Rennes and BYU Polylib.

Latest version on GIT

• Git repository: https://github.com/vincentloechner/polylib or http://repo.or.cz/w/polylib.git

Packages

• Debian .deb packages. Serge Guelton made these available, thanks to him!
  Debian (unstable distribution): http://ridee.enstb.org/debian/info.html.
  The .deb individual files are available here.

Source

• tar.gz images of the PolyLib: polylib_src/
  What's new ?
  • in 5.22.5 (2010): bsd-make compatibility, moved to GPLv3.
    
  • in 5.22.4: cleaned installation, many minor corrections and updates.
    
  • in 5.22.3: memory leaks (Sven).
    
  • in 5.22.2: various bug corrections and updates (RemoveNColumns for Paul).
    
  • in 5.22.1: Ehrhart polynomial approximations (B. Meister), ranking function, memory leaks+bug corrections (S. Verdoolaege).
    
  • in 5.20.0: Installation procedure (full GNU auto-tools), many changes in sources.
    
  • in 5.11.1: remove memory leakages from ehrhart, polyparam, and Disjoint_Union.
    
  • in 5.11: Reduced complexity of Ehrhart polynomials computation by calculating one lcm per parameter.
    Function Domain_Enumerate, enumerating a union of polyhedra by computing a disjoint union first, and computing the sum of the resulting per-domain polynomials.
    Various changes in configure script and Makefiles.

The documentation:

You may contact Vincent Loechner for any information, bug report, compilation problems, ...

Examples:

Ehrhart Polynomials Page, by Philippe Clauss, and related publications.

Parma Polyhedra Library