1 barvinok is a library for counting the number of integer points
2 in parametric and non-parametric polytopes as well as projections
4 For parametric polytopes the count is represented by either
5 an explicit function or a generating function.
6 The first comes in the shape of a piece-wise step-polynomial.
7 This is a generalization of both Ehrhart quasi-polynomials
8 and vector partition functions.
9 The second is a generalization of an Ehrhart series.
11 This library shares some functionality with LattE
12 (http://www.math.ucdavis.edu/~latte/)
13 and uses PolyLib (included), PIP (included), NTL (http://shoup.net/ntl/)
14 and optionally Omega (included).
15 If you have cloned the git repository, you need to run
19 to get the submodules and create the configure scripts.
21 Additionally, the following packages can optionally be used
22 - GLPK (http://www.gnu.org/software/glpk/)
23 - GiNaC (http://www.ginac.de/) (needed for the bernstein library)
25 NTL needs to have been compiled with GMP support.
26 That is, you have to specify
29 Suppose you want to put everything in /opt,
30 Then you configure/compile NTL using
32 ./configure --prefix=/opt
39 ./configure NTL_GMP_LIP=on PREFIX=/opt GMP_PREFIX=/path/to/gmp
43 Configure this library using
45 ./configure --prefix=/opt --with-libgmp=/path/to/gmp --with-ntl=/opt
47 If you want shared libraries, then configure with the
48 --enable-shared-barvinok option.
49 Note that this doesn't work on some systems because we link in libntl, which
50 is only available as a static library.
51 Also note that if you have previously installed a shared library of an older
52 version of barvinok, and you do not install one for this version, then the
53 linker may pick up the old shared library rather than the new static library.
55 If you don't want to compile and use Omega, then configure with
56 the --without-omega option.
64 If you want to put any one of these packages in the default location
65 (typically /usr/local), then the prefix argument can be omitted.
66 For more information on other arguments,
70 The input format of barvinok_enumerate is the same as that
71 of testehrhart from the PolyLib distribution.
72 See the PolyLib manual, barvinok_enumerate.c or the
73 examples in tests/ehrhart/ .
75 Note that the fractional representation is subject to change.
77 The library supports three specialization algorithms.
78 The first performs a direct specialization using a random vector.
79 The second performs a "depth-first" incremental specialization.
80 The third performs a "breadth-first" incremental specialization.
82 The first is usually the fastest, but can fail if the random
83 vector happens to be chosen incorrectly.
84 The incremental algorithms should never fail, but can be slower,
85 in some cases by quite a bit. The breadth-first version should
86 be faster than the depth-first version, especially on polytopes
87 of moderate dimension with a lot of "structure", but can require
90 Sven Verdoolaege <skimo@kotnet.org>