{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:28:23Z","timestamp":1649046503289},"reference-count":47,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0925-7721(01)00049-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:02:47Z","timestamp":1027591367000},"page":"143-166","source":"Crossref","is-referenced-by-count":4,"title":["Enumerating a subset of the integer points inside a Minkowski sum"],"prefix":"10.1016","volume":"22","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00049-9_BIB001","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01582137","article-title":"A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variables ratio","volume":"61","author":"Adler","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB002","series-title":"User's guide for lrs\u2014version 4.0","author":"Avis","year":"2000"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB003","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","article-title":"How good are convex hull algorithms?","volume":"7","author":"Avis","year":"1997","journal-title":"Computational Geometry Theory and Applications"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB004","series-title":"New Perspectives in Algebraic Combinatorics","first-page":"91","article-title":"An algorithmic theory of lattice points in polyhedra","volume":"38","author":"Barvinok","year":"1999"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB005","series-title":"Algorithms for Robotic Motion and Manipulation","article-title":"Polyhedral tracings and their convolution","author":"Basch","year":"1996"},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB006","first-page":"183","article-title":"The number of roots of a system of equations","volume":"9","author":"Bernstein","year":"1975","journal-title":"Funct. Anal. Appl."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB007","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01075529","article-title":"The number of integral points in integral polyhedra","volume":"10","author":"Bernstein","year":"1976","journal-title":"Funct. Anal. Appl."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB008","series-title":"Introduction to Linear Optimization","author":"Bertsimas","year":"1997"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB009","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0010-4485(97)00074-2","article-title":"Slicing Minkowski sums for satellite antenna layout","volume":"30","author":"Boissonnat","year":"1998","journal-title":"Computer-Aided Design"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB010","series-title":"An algorithm for the Newton resultant, Technical Report 1394","author":"Canny","year":"1993"},{"issue":"3","key":"10.1016\/S0925-7721(01)00049-9_BIB011","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/337244.337247","article-title":"A subdivision-based algorithm for the sparse resultant","volume":"47","author":"Canny","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB012","series-title":"Proc. 12th Annual ACM Symp. on Computational Geometry, Philadelphia, PA","first-page":"284","article-title":"Fixed-dimensional linear programming queries made easy","author":"Chan","year":"1996"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB013","series-title":"PORTA, version 1.3","author":"Christof","year":"1999"},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB014","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","article-title":"Las Vegas algorithms for linear and integer programming when the dimension is small","volume":"42","author":"Clarkson","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB015","series-title":"Using Algebraic Geometry","volume":"185","author":"Cox","year":"1998"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB016","first-page":"1","article-title":"Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne, I. Poly\u00e8dres et r\u00e9seaux","volume":"226","author":"Ehrart","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB017","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1006\/jcom.1996.0010","article-title":"On the complexity of sparse elimination","volume":"12","author":"Emiris","year":"1996","journal-title":"J. Complexity"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB018","series-title":"Proc. 16th Annual ACM Symp. on Computational Geometry, Hong Kong","first-page":"29","article-title":"Computing integer points in Minkowski sums","author":"Emiris","year":"2000"},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB019","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jsco.1995.1041","article-title":"Efficient incremental algorithms for the sparse resultant and the mixed volume","volume":"20","author":"Emiris","year":"1995","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB020","series-title":"Sparse results in sparse elimination, Draft","author":"Emiris","year":"2000"},{"issue":"4","key":"10.1016\/S0925-7721(01)00049-9_BIB021","first-page":"15","article-title":"Zonohedra and zonotopes","volume":"5","author":"Eppstein","year":"1996","journal-title":"Mathematica in Education and Research"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB022","series-title":"cdd\/cdd+ reference manual, version 0.61\/0.76","author":"Fukuda","year":"1999"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB023","unstructured":"K. Fukuda, H. Br\u00f6nnimann, Personal communication, 1999"},{"issue":"1","key":"10.1016\/S0925-7721(01)00049-9_BIB024","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00454-001-0024-0","article-title":"Decomposition of polytopes and polynomials","volume":"26","author":"Gao","year":"2001","journal-title":"Discret. Comput. Geometry"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB025","series-title":"Proc. 16th Annual ACM Symp. on Computational Geometry, Hong Kong","first-page":"91","article-title":"Random sampling in geometric optimization: New insights and applications","author":"G\u00e4rtner","year":"2000"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB026","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0022-4049(96)00099-0","article-title":"Straight-line programs in geometric elimination theory","volume":"124","author":"Giusti","year":"1998","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB027","series-title":"Polytopes: Abstract, Convex and Computational","first-page":"373","article-title":"On the complexity of some basic problems in computational convexity II: Volume and mixed volumes","author":"Gritzmann","year":"1994"},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB028","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0406019","article-title":"Minkowski addition of polytopes: computational complexity and applications to Groebner bases","volume":"6","author":"Gritzmann","year":"1993","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB029","series-title":"Handbook for Convex Geometry, Vol. B","article-title":"Lattice points","author":"Gritzmann","year":"1993"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB030","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1993"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB031","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB032","series-title":"Proc. 2nd Annual ACM Symp. on Computational Geometry","first-page":"90","article-title":"Computing convolutions by reciprocal search","author":"Guibas","year":"1986"},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB033","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02770870","article-title":"Bernstein's theorem in affine space","volume":"17","author":"Huber","year":"1997","journal-title":"Discr. Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB034","series-title":"Proc. 3rd Canadian Conf. on Computational Geometry, Vancouver, BC","first-page":"74","article-title":"Computing Minkowski sums of regular polygons","author":"Kaul","year":"1991"},{"issue":"1","key":"10.1016\/S0925-7721(01)00049-9_BIB035","first-page":"51","article-title":"Newton polyhedra and the genus of complete intersections","volume":"12","author":"Khovanskii","year":"1978","journal-title":"Funktsional'nyi Analiz i Ego Prilozheniya"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB036","series-title":"Fewnomials","author":"Khovanskii","year":"1991"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB037","first-page":"266","article-title":"The Newton polyhedron and the number of solutions of a system of k equations in k unknowns","volume":"30","author":"Kushnirenko","year":"1975","journal-title":"Uspekhi Mat. Nauk."},{"issue":"2","key":"10.1016\/S0925-7721(01)00049-9_BIB038","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1090\/S0002-9947-1986-0825717-3","article-title":"Volume of mixed bodies","volume":"294","author":"Lutwak","year":"1986","journal-title":"Trans. AMS"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB039","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jagm.1993.1023","article-title":"Linear optimization queries","volume":"14","author":"Matou\u0161ek","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB040","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","article-title":"The complexity of the word problem for commutative semigroups and polynomial ideals","volume":"46","author":"Mayr","year":"1982","journal-title":"Adv. Math."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB041","series-title":"Linear programming frequently asked questions","year":"2000"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB042","series-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"Press","year":"1992"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB043","series-title":"Proc. 12th Annual ACM Symp. on Computational Geometry, Philadelphia, PA","first-page":"234","article-title":"An algorithm to compute the Minkowski sum outer-face of two simple polygons","author":"Ramkumar","year":"1996"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB044","series-title":"Proc. 16th Annual ACM Symp. on Computational Geometry, Hong Kong","first-page":"176","article-title":"Linear programming queries revisited","author":"Ramos","year":"2000"},{"issue":"1","key":"10.1016\/S0925-7721(01)00049-9_BIB045","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(93)00062-A","article-title":"A convex geometric approach to counting the roots of a polynomial system","volume":"133","author":"Rojas","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0925-7721(01)00049-9_BIB046","series-title":"The Algorithm Design Manual","author":"Skiena","year":"1997"},{"key":"10.1016\/S0925-7721(01)00049-9_BIB047","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","article-title":"An algorithm for linear programming which requires O((m+n)n2+(m+n)1.5n)L) arithmetic operations","volume":"41","author":"Vaidya","year":"1990","journal-title":"Math. Programming"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000499?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000499?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:26:58Z","timestamp":1556465218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":47,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0925772101000499"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00049-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}