Enumerating a subset of the integer points inside a Minkowski sum

Adler, 1993, A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variables ratio, Math. Programming, 61, 39, 10.1007/BF01582137 Avis, 2000 Avis, 1997, How good are convex hull algorithms?, Computational Geometry Theory and Applications, 7, 265, 10.1016/S0925-7721(96)00023-5 Barvinok, 1999, An algorithmic theory of lattice points in polyhedra, 38, 91 Basch, 1996, Polyhedral tracings and their convolution Bernstein, 1975, The number of roots of a system of equations, Funct. Anal. Appl., 9, 183 Bernstein, 1976, The number of integral points in integral polyhedra, Funct. Anal. Appl., 10, 223, 10.1007/BF01075529 Bertsimas, 1997 Boissonnat, 1998, Slicing Minkowski sums for satellite antenna layout, Computer-Aided Design, 30, 255, 10.1016/S0010-4485(97)00074-2 Canny, 1993 Canny, 2000, A subdivision-based algorithm for the sparse resultant, J. ACM, 47, 417, 10.1145/337244.337247 Chan, 1996, Fixed-dimensional linear programming queries made easy, 284 Christof, 1999 Clarkson, 1995, Las Vegas algorithms for linear and integer programming when the dimension is small, J. ACM, 42, 488, 10.1145/201019.201036 Cox, 1998, 185 Ehrart, 1967, Sur un problème de géométrie diophantienne, I. Polyèdres et réseaux, J. Reine Angew. Math., 226, 1 Emiris, 1996, On the complexity of sparse elimination, J. Complexity, 12, 134, 10.1006/jcom.1996.0010 Emiris, 2000, Computing integer points in Minkowski sums, 29 Emiris, 1995, Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput., 20, 117, 10.1006/jsco.1995.1041 Emiris, 2000 Eppstein, 1996, Zonohedra and zonotopes, Mathematica in Education and Research, 5, 15 Fukuda, 1999 K. Fukuda, H. Brönnimann, Personal communication, 1999 Gao, 2001, Decomposition of polytopes and polynomials, Discret. Comput. Geometry, 26, 89, 10.1007/s00454-001-0024-0 Gärtner, 2000, Random sampling in geometric optimization: New insights and applications, 91 Giusti, 1998, Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra, 124, 101, 10.1016/S0022-4049(96)00099-0 Gritzmann, 1994, On the complexity of some basic problems in computational convexity II: Volume and mixed volumes, 373 Gritzmann, 1993, Minkowski addition of polytopes: computational complexity and applications to Groebner bases, SIAM J. Disc. Math., 6, 246, 10.1137/0406019 Gritzmann, 1993, Lattice points Grötschel, 1993 Grünbaum, 1967 Guibas, 1986, Computing convolutions by reciprocal search, 90 Huber, 1997, Bernstein's theorem in affine space, Discr. Comput. Geom., 17, 137, 10.1007/BF02770870 Kaul, 1991, Computing Minkowski sums of regular polygons, 74 Khovanskii, 1978, Newton polyhedra and the genus of complete intersections, Funktsional'nyi Analiz i Ego Prilozheniya, 12, 51 Khovanskii, 1991 Kushnirenko, 1975, The Newton polyhedron and the number of solutions of a system of k equations in k unknowns, Uspekhi Mat. Nauk., 30, 266 Lutwak, 1986, Volume of mixed bodies, Trans. AMS, 294, 487, 10.1090/S0002-9947-1986-0825717-3 Matoušek, 1993, Linear optimization queries, J. Algorithms, 14, 432, 10.1006/jagm.1993.1023 Mayr, 1982, The complexity of the word problem for commutative semigroups and polynomial ideals, Adv. Math., 46, 305, 10.1016/0001-8708(82)90048-2 2000 Press, 1992 Ramkumar, 1996, An algorithm to compute the Minkowski sum outer-face of two simple polygons, 234 Ramos, 2000, Linear programming queries revisited, 176 Rojas, 1994, A convex geometric approach to counting the roots of a polynomial system, Theor. Comput. Sci., 133, 105, 10.1016/0304-3975(93)00062-A Skiena, 1997 Vaidya, 1990, An algorithm for linear programming which requires O((m+n)n2+(m+n)1.5n)L) arithmetic operations, Math. Programming, 41, 175, 10.1007/BF01580859