A polynomial time algorithm for Minkowski reconstruction

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A polynomial time algorithm for Minkowski reconstruction

Full text

Pdf (704 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 1 - 9

Year of Publication: 1995

ISBN:0-89791-724-3

Authors

Peter Gritzmann	Universität Trier, Fb IV, Mathematik, D-54286 Trier, Germany
Alexander Hufnagel	Universität Trier, Fb IV, Mathematik, D-54286 Trier, Germany

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): 2, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

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/220279.220280 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	M. E. Dyer , A. M. Frieze, On the complexity of computing the volume of a polyhedron, SIAM Journal on Computing, v.17 n.5, p.967-974, October 1988 [doi>10.1137/0217060]
	2	M.E. Dyer, P. Gritzmann, and A. Hufnagel, On the complexity of computing mixed volumes, Manuscript, 1994.
	3	M.R. Garey and D.S. Johnson, Computers and intractability, Freeman, San Francisco, 1979.
	4	P. Gritzmann and A. Hnfnagel, On the algorithmic complexity of Minkowski's reconstruction theorem, Manuscript, 1994.
	5	P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: Ii. Volume and mixed voh~mes, Polytopes: Abstract, Convex and Computational (Boston) (T. Bisztriczky, P. McMullen, R. Schneider, and A. I. Weiss, eds.), Kluwer, 1994, pp. 373-466.
	6	H. Groemer, On an inequality of Minkowski for mixed volumes, Geom. Dedicata 33 (1990), 117-122.
	7	~, Stability of geometric inequalities, Handbook of Convex Geometry Vol. A (Amsterdam) (P.M. Gruber and J.M. Wills, eds.), North-Holland, 1993, pp. 125-150.
	8	M. Gr~Stschel, L. Lov&sz, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer, Berlin, 1988.
	9	B.K.P. Horn, Extended Gaussian images, Proceedings of the IEEE 72 (1984), 1671-1686.
	10	Berthold Klaus Paul Horn, Robot vision, MIT Press, Cambridge, MA, 1986
	11	A. Hufnagel, Algorithmic problems in Brunn-Minkowski theory, Dissertation, Trier, 1995.
	12	J. Lawrence, Polytope volume computation, Math. Comput. 57 (1991), 259-271.
	13	J.J. Little, An iterative method for reconstructing convex polyhedra from extended Gaussian images, Proceedings of the AAAI, National Conference on Artificial Intelligence (Washington D.C.), 1983, pp. 247-250.
	14	James J. Little, Extended Gaussian images, mixed volumes, shape reconstruction, Proceedings of the first annual symposium on Computational geometry, p.15-23, June 05-07, 1985, Baltimore, Maryland, United States [doi>10.1145/323233.323236]
	15	H. Minkowski, Allgemeine Lehrs~tze ~ber konvexe Polyeder, Nachr. Ges. Wiss. G~ttingen (1897), 198-219.
	16	~___, Volumen und Oberflgche, Math. Ann. 57 (1903), 447-495.
	17	J.R. Sangwine-Yager, Mixed volumes, Handbook of Convex Geometry, Vol. A (Amsterdam) (P.M. Gruber and J.M. Wills, eds.), North-Holland, 1993, pp. 43-72.
	18	R. Schneider, Convex bodies: The Brunn-Minkowski theory, Encyclopedia of Mathematics and its Applications, Vol. 44, Cambridge University Press, 1993.