Computing integer points in Minkowski sums

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing integer points in Minkowski sums

Full text

Pdf (825 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the sixteenth annual symposium on Computational geometry table of contents

Clear Water Bay, Kowloon, Hong Kong

Pages: 29 - 36

Year of Publication: 2000

ISBN:1-58113-224-7

Author

Ioannis Z. Emiris

INRIA, B.P. 93, Sophia-Antipolis 06902, France

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 9, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/336154.336169 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. Boissonnat, E. de Lange, and M. Teillaud. Slicing Minkowski sums for satellite antenna layout. Computer-Aided Design, 30:255-265, 1998.
	2	M. Bussieck and M. Luebbecke. The vertex set of a 0/1-polytope is strongly P-enumerable. In Proc. ISMP-97, Lausanne, Switzerland, August 1997.
	3	T. Christof, A. Loebel, and M. Stoer. PORTA, version 1.3, 1999. University of Heidelberg and ZIB Berlin. www. iwr. uni-heidelb erg. de/iwr / comopt /soft /PO RTA.
	4	D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry. Number 185 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1998.
	5	Ioannis Z. Emiris, On the complexity of sparse elimination, Journal of Complexity, v.12 n.2, p.134-166, June 1996 [doi>10.1006/jcom.1996.0010]
	6	Ioannis Z. Emiris , John F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume, Journal of Symbolic Computation, v.20 n.2, p.117-149, Aug. 1995 [doi>10.1006/jsco.1995.1041]
	7	Ioanis Z. Emiris , Victor Y. Pan, The structure of sparse resultant matrices, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.189-196, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258779]
	8	D. Eppstein. Zonohedra and zonotopes. Mathematica in Education and Research, 5(4):15-21, 1996.
	9	P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity II: Volume and mixed volumes. In T. Bisztriczky, P. McMullen, R. Schneider, and A. I. Weiss, editors, Polytopes: Abstract, Convex and Computational, pages 373-466. Kluwer, Boston, 1994.
	10	P. Gritzmann and j. Wills. Lattice points. In P. Gruber and J. Wills, editors, Handbook for Convex Geometry, volume B. North Holland, Amsterdam, 1993.
	11	M. GrStschel, L. Lovfisz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 2nd edition, 1993.
	12	B. Griinbaum. Convex Polytopes. Wiley-Interscience, New York, 1967.
	13	L Guibas , R Seidel, Computing convolutions by reciprocal search, Proceedings of the second annual symposium on Computational geometry, p.90-99, June 02-04, 1986, Yorktown Heights, New York, United States [doi>10.1145/10515.10525]
	14	A. Kaul, M. O'Connor, and V. Srinivasan. Computin~ Minkowski Sums of Regular Polygons. In Proc. Canadian Conf. on Comput. Geometry, pages 74-77, 1991.
	15	E. Lutwak. Volume of mixed bodies. Trans. AMS, 294(2):487-500, 1986.
	16	William H. Press , Saul A. Teukolsky , William T. Vetterling , Brian P. Flannery, Numerical recipes in C (2nd ed.): the art of scientific computing, Cambridge University Press, New York, NY, 1992
	17	Steven S. Skiena, The algorithm design manual, Springer-Verlag New York, Inc., New York, NY, 1997
	18	B. Sturmfels and A. Zelevinsky. Multigraded resultants of Sylvester type. J. Algebra, 163(1):115-127, 1994.