Successive linear programs for computing all integral points in a minkowski sum

Authors:
Ioannis Z. Emiris;Kyriakos Zervoudakis
Affiliations:
Dept. of Informatics and Telecommunications, National University of Athens, Greece;Dept. of Informatics and Telecommunications, National University of Athens, Greece
Venue:
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Year:
2005

Citing 8
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases

SIAM Journal on Discrete Mathematics
Efficient incremental algorithms for the sparse resultant and the mixed volume

Journal of Symbolic Computation
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs

ICS '96 Proceedings of the 10th international conference on Supercomputing
Parallelizing compiler techniques based on linear inequalities

Parallelizing compiler techniques based on linear inequalities
Computational convexity

Handbook of discrete and computational geometry
Multihomogeneous resultant formulae by means of complexes

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Enumerating a subset of the integer points inside a Minkowski sum

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computation of all integral points in Minkowski (or vector) sums of convex lattice polytopes of arbitrary dimension appears as a subproblem in algebraic variable elimination, parallel compiler code optimization, polyhedral combinatorics and multivariate polynomial multiplication. We use an existing approach that avoids the costly construction of the Minkowski sum by an incremental process of solving Linear Programming (LP) problems. Our main contribution is to exploit the similarities between LP problems in the tree of LP instances, using duality theory and the two-phase simplex algorithm. Our public domain implementation improves substantially upon the performance of the above mentioned approach and is faster than porta on certain input families; besides, the latter requires a description of the Minkowski sum which has high complexity. Memory consumption limits commercial or free software packages implementing multivariate polynomial multiplication, whereas ours can solve all examined data, namely of dimension up to 9, using less than 2.7 MB (before actually outputting the points) for instances yielding more than 3 million points.