| blob | 7aba591dcf6c0275e41b3050963c778eeca1ed8f |
1 version: 0.23
2 date: Sat Apr 28 20:10:35 CEST 2007
3 changes:
4 - use arpg for argument parsing in most commands
5 - |-
6 support polynomial approximations of quasi-polynomials, including
7 volume computation, Meister's method and replacing fractional parts
8 by constants
9 - add barvinok_maximize for computing upper (and lower) bounds
10 - support non-parametric primal and stopped Barvinok decomposition
11 - periodic number representation now run-time configurable
12 - drop support for ancient PolyLib versions
13 - simplified partitioning of chamber complex
14 - add evalue_eval, an exact version of copmute_evalue
15 - improved handling of large generating functions
16 - integrate barvinok_series functionality into barvinok_enumerate
17 - support use of cdd for solving LPs in basis reduction
18 - initial support for computing bounds over quasi-polynomials
19 - recursive Bernstein expansion
20 - corrections and improvements of lexmin
21 - optionally print quasi-polynomial as list of polynomials
22 - add some documentation
23 ---
24 version: 0.22
25 date: Tue Oct 31 23:15:15 CET 2006
26 changes:
27 - include bernstein library with interface to barvinok and occ
28 - some occ clean-ups
29 - barvinok_count now only returns -1 for unbounded polyhedra with integer points
30 - preliminary implementation of projection via neighborhood complexes
31 - implement generalized basis reduction
32 - add polyhedron_sample
33 - add polytope_scan
34 - add lexmin
35 - some internal reorganization
36 - some gen_fun clean-ups and optimizations
37 - plug some memory leaks
38 - fix some corner cases
39 - shared libraries are no longer built by default
40 - introduce barvinok_options to pass to functions instead of just MaxRays
41 - use same LLL reduction parameter that LattE uses
42 - add some documentation
43 ---
44 version: 0.21
45 date: Thu Jun 22 20:49:11 CEST 2006
46 changes:
47 - add some documentation
48 - add barvinok_ehrhart
49 - add h_star_vector polymake client
50 - fix some corner cases
51 - more experimental support for enumerating unions of polytopes
52 - rename cdd2polylib.pl to latte2polylib.pl
53 ---
54 version: 0.20
55 date: Wed Feb 22 12:01:23 CET 2006
56 changes:
57 - fix PIP-based reduction by removing some code and assuming a recent PIP
58 - some memory leaks plugged
59 - optionally use Omega as a preprocessor in barvinok_enumerate_e
60 - integrate verif_ehrhart_e into barvinok_enumerate_e
61 - barvinok_series handles more problem with equalities
62 - add gen_fun::Hadamard_product
63 - experimental support for enumerating unions of polytopes
64 ---
65 version: 0.19
66 date: Fri Jan 20 22:14:44 CET 2006
67 changes:
68 - include Omega Calculator interface occ
69 - print_enode creates parameter names if none are provided
70 - only use PIP to project out some variables
71 - some header file fixes
72 - C89 fixes again
73 ---
74 version: 0.18
75 date: Thu Sep 15 11:27:19 CEST 2005
76 changes:
77 - factor polyhedra into independent parts before enumeration
78 - make "random vector" specialization more robust
79 - speed up verif_ehrhart by only checking inside the context
80 - remove {Param,}Polyhedron_Reduce
81 - rename triangularize_cone to triangulate_cone
82 - generalize computation of lexmin/max using PIP
83 - compute the number of lexsmaller elements using PolyLib's LexSmaller
84 ---
85 version: 0.17
86 date: Mon Aug 1 12:23:50 CEST 2005
87 changes:
88 - fix some configuration problems
89 - include minimal polymake client
90 ---
91 version: 0.16
92 date: Thu Jun 30 12:10:29 CEST 2005
93 changes:
94 - implement "breadth-first" incremental specialization
95 - implement non-incremental version for series computation
96 - make non-incremental specialization the default again
97 - check for bad PolyLib version at runtime
98 - compiles on Windows (mingw32)
99 - add version option
100 - allow crosscompilation
101 - compute the coefficients of an Ehrhart series
102 - fix conversion of PIP output to polyhedra
103 - allow direct verification of Ehrhart series
104 ---
105 version: 0.15
106 date: Sun Dec 12 23:00:40 CET 2004
107 changes:
108 - export Polyhedron_Project
109 - allow verification of step-functions computed from Ehrhart series
110 - optionally compute step-functions incrementally
111 - disable possibly incorrect optimization
112 - minor optimizations in Ehrhart series computations
113 ---
114 version: 0.14
115 date: Wed Nov 17 19:22:23 CET 2004
116 changes:
117 - use code for computing series to count non-parametric polytopes
118 - add conversion from series to explicit function
119 - fix removal of redundant equalities
120 ---
121 version: 0.13
122 date: Sat Oct 16 12:13:30 CEST 2004
123 changes:
124 - use slightly larger random numbers
125 - change basis to remove existential variable
126 - fix bug in reduction
127 - handle empty PIP solution
128 - add utility to remove equalities
129 ---
130 version: 0.12
131 date: Sun Oct 3 20:47:11 CEST 2004
132 changes:
133 - reduce memory requirements
134 - add cdd2polylib.pl
135 - add patch for NTL 5.3.2
136 - experimental support for Ehrhart series
137 - compile fix on systems that lack <getopt.h>
138 ---
139 version: 0.11
140 date: Sat Sep 18 14:49:40 CEST 2004
141 changes:
142 - fix minor bugs
143 - find and use PIP if available
144 - don't overallocate matrices on newer PolyLibs
145 - verification program for enumeration of integer projections
146 - summation of enumerations
147 - avoid gccisms
148 - support older versions of GMP
149 ---
150 version: 0.10
151 date: Tue Jul 6 22:09:11 CEST 2004
152 changes:
153 - install header files
154 - modulo representation changed to fractionals
155 - perform some simplifications on the modulo representation
156 - barvinok_enumerate returns a malloc'ed evalue
157 - a few bugs in barvinok_enumerate_e removed
158 - optionally print an indication of the size of an enumeration
159 - emask added
160 - bug in triangularization fixed
161 - bug in polyhedron reduction fixed
162 - verif_ehrhart.c should compile on C89 systems again
163 ---
164 version: 0.09
165 changes:
166 - bug in polyhedron reduction fixed
167 ---
168 version: 0.08
169 date: Sun Feb 22 21:15:00 CET 2004
170 changes:
171 - remove remaining part of Kristof's Ehrhart manipulation code
172 - optimize modulo expression based on validity domain
173 - support partition evalues
174 - factor out 1D polytopes
175 - validity domains can now be unions of polytopes
176 - optionally convert modulo representation to lookup-table
177 - rename indicator to relation
178 - add DomainIncludes
179 ---
180 version: 0.07
181 changes:
182 - support "indicator" evalues
183 - support equalities for modulo representation
184 ---
185 version: 0.06
186 changes:
187 - remove part of Kristof's Ehrhart manipulation code
188 - partial support for modulo representation
189 - support cvs version of PolyLib
190 ---
191 version: 0.05
192 date: Thu Nov 27 13:35:59 CET 2003
193 changes:
194 - |-
195 include code from Kristof Beyls for manipulating Ehrhart
196 polynomials
197 - |-
198 implement barvinok_enumerate for constructing Ehrhart
199 polynomials using barvinok's algorithm
200 ---
201 version: 0.04
202 date: Thu Nov 6 01:36:25 CET 2003
203 changes:
204 - |-
205 allow specification of max #constraints
206 for those without automatically growing chernikova tables
207 - fix a few small bugs
208 - some minor optimizations
209 ---
210 version: 0.03
211 date: Mon Nov 3 16:35:57 CET 2003
212 changes:
213 - fix a number of bugs
214 - add tests
215 ---
216 version: 0.02
217 date: Mon Oct 20 14:15:45 CEST 2003
218 changes:
219 - change name from count to barvinok_count
220 - return -1 if polyhedron is unbounded
221 - trivially optimize counting in presence of some independent constraints