The volume is one of the central properties of a convex body, and volume computation is involved in many hard problems. Applications range from rather classical ones as in convex optimisation to problems in remote fields like algebraic geometry where the number of common roots of polynomials can be related to a special polytope volume.

Part of the fascination of the subject stems from the discrepancy between the intuitive notion of "volume" and the actual hardness of computing it. Despite this discouraging complexity - algorithms in general need exponential time in the input dimension - steadily growing computer power enables us to attack problems of practical interest.

Vinci is an easy to install C package that implements the state of the art algorithms for volume computation. It is the fruit of a research project carried out at the IFOR (Institute for Operations Research) at ETH Zürich, in collaboration with Benno Büeler and Komei Fukuda. The code is released under the GnuGeneral Public License.

Polytope files

The following is a collection of polytopes on which we tested our volume computation codes. The polytopes are given in the file format specified by David Avis and Komei Fukuda. We included the .ext- and .ine-files (if this sounds weird to you, you had better read the Vincidocumentation, it comprises a description of the file format). The data are split into separate files, each of them corresponding to a different problem class.