Useful extensions
Explores triangulations of points configurations.
by Benno Büeler, Andreas Enge, and Komei Fukuda.
Computes the volume of polytopes using floating point arithmetic.
LattE is a software dedicated to the problems of counting and detecting lattice points inside convex
polytopes, and the solution of integer programs. LattE contains the first ever implementation of Barvinok's
algorithm. LattE stands for "Lattice point Enumeration".
barvinok is a library for counting the number of integer points in parametrized and non-parametrized polytopes. For
parametrized polytopes an explicit function in the shape of a piece-wise step-polynomial is constructed. This is a
generalization of both Ehrhart quasi-polynomials and vector partition functions. Alternatively, a generalized Ehrhart
series can be constructed as well.
It comes with a polymake client in the projects polymake subdirectory.
by Loic Pottier.
Computes the interior integral lattice points.
An implementation of Fourier-Motzkin elimination. This program seems not to be further developed nor maintained any more;
moreover, the limited precision arithmetic used in it makes it fail on complex problems.
We offer an interface mostly for historical reasons.
by Matthias Franz.
Convex is a Maple package for convex geometry. It can deal with polytopes and, more generally, with all kinds of polyhedra
of (in principle) arbitrary dimension. The only restriction is that all coordinates must be rational. polymake interface.
by Graham Ellis.
HAP is a homological algebra library for use with the GAP computer algebra system, and is still under development. Its
initial focus is on computations related to the cohomology of groups. Both finite and infinite groups are handled, with main
emphasis on integer coefficients. For polyhedral computations, HAP interfaces to polymake.
by Markus Behle.
azove is a tool designed for counting (without explicit enumeration) and enumeration of 0/1 vertices.
Given a polytope by a linear relaxation or facet description P = {x | Ax <= b}, all 0/1 points lying in P can be counted
or enumerated. This is done by intersecting the polytope P with the unit-hypercube [0,1]d. The integral vertices (no
fractional ones) of this intersection will be enumerated. If P is a 0/1 polytope, azove solves the vertex enumeration problem.
Visualization
by Konrad Polthier, Samy Khadem, Eike Preuss, Ulrich Reitebuch,
Visualizes 3D- and 4D-polytopes (and much more).
Visualization of phylogenetic trees.
Visualizes 3D- and 4D-polytopes.
3D- and 4D-visualization by high-end ray-tracing.
Visualizes graphs and face lattices.
Topology
by Frank Heckenbach, Uni Erlangen-Nürnberg
An efficient program computing homology groups of simplicial complexes.
The famous group-theoretical software package. Can be used to analyze the fundamental group
of a simplicial complex.
You should download and install these packages on your own, provided you accept the license agreements.
Don't merge them into the polymake directory tree, as they might get overwritten by the next polymake upgrade.
For your convenience, the interface components for external software are kept in separate rule files.
The auto-configuration routines defined there try to find the installed software (usually by examining your
PATH variable). In the case of failure, the rule file gets disabled until you install the lacking
software package and repeat the auto-configuration (
polymake --reconfigure or
--reconfigure-rules ).
At any rate, we strongly recommend you to install some visualization software (preferably JavaView),
as polymake were much more boring without all these colorful pictures.