Folding flat silhouettes and wrapping polyhedral packages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami

Full text

Pdf (1.14 MB)

Source

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

Miami Beach, Florida, United States

Pages: 105 - 114

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Erik D. Demaine	Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Martin L. Demaine
Joseph S. B. Mitchell	Dept. of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY

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): 7, Downloads (12 Months): 31, Citation Count: 4

Additional Information:

references cited by 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/304893.304933 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.

	AA96	Oswin Aichholzer , Franz Aurenhammer, Straight Skeletons for General Polygonal Figures in the Plane, Proceedings of the Second Annual International Conference on Computing and Combinatorics, p.117-126, June 17-19, 1996
	AAAG95	Oswin Aichholzer, Franz Aurenhammer, David Alberts, and Bernd G~rtner. A novel type of skeleton for polygons. Journal of Universal Computer Science, 1(12):752- 761, 1995.
	AFM97	Esther M. Arkin, S~ndor P. Fekete, and Joseph S. B. Mitchell. Approximation algorithms for lawn mowing and milling. Technical Report 97.255, Angewandte Mathematik und Informatik, Universit/it zu KSln, 1997. Submitted to Computational Geometry: Theory and Applications.
	AHMS96	Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, and Steven S. Skiena. Hamiltonian triangulations for fast rendering. The Visual Computer, 12(9):429-444, 1996.
	Aki97	Jin Akiyama. Why Taro can do geometry. In Proceedings of the 9th Canadian Conference on Computational Geometry, page 112, August 1997. invited talk.
	AOS97	Jin Akiyama, Takemasa Ooya, and Yuko Segawa. Wrapping a cube. Teaching Mathematics and Its Applications, 16(3):95-100, 1997.
	BH96	Marshall Bern , Barry Hayes, The complexity of flat origami, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.175-183, January 28-30, 1996, Atlanta, Georgia, United States
	CD85	Bernard Chazelle and D. P. Dobkin. Optimal convex decompositions. In G. T. Toussaint, editor, Computational Geometry, pages 63-133. North-Holland, Amsterdam, 1985.
	EE98	David Eppstein , Jeff Erickson, Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, Proceedings of the fourteenth annual symposium on Computational geometry, p.58-67, June 07-10, 1998, Minneapolis, Minnesota, United States [doi>10.1145/276884.276891]
	Gre83	D.H. Greene. The decomposition of polygons into convex parts. In F. P. Preparata, editor, Computational Geometry, pages 235-259. JAI Press, London, 1983.
	Has96	Taichiro Hasegawa. Magical Origami: Alphabets and Numerals. Seibundoh Shinkosha, 1996.
	Kas88	Kunihiko Kasahara. Origami Omnibus. Japan Publications, Inc., 1988.
	Kei	J. Mark Keil. Polygon decomposition. In JSrg-Riidiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B.V. North- Holland, Amsterdam. To appear.
	Kei83	J. Mark Keil. Decomposing polygons into simpler components. PhD thesis, University of Toronto, Toronto, Canada# 1983.
	Kei85	J. Mark Keil. Decomposing a polygon into simpler components. SIAM Journal on Computing, 14(4):799-817, November 1985.
	KT87	Kunihiko Kasahara and Toshie Takahama. Origami for the Connoisseur. Japan Publications, Inc., 1987.
	Lan96	Robert J. Lang, A computational algorithm for origami design, Proceedings of the twelfth annual symposium on Computational geometry, p.98-105, May 24-26, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237218.237249]
	Lin72	Andrzej Lingas, The Power of Non-Rectilinear Holes, Proceedings of the 9th Colloquium on Automata, Languages and Programming, p.369-383, July 12-16, 1982
	LW84	E.A. Lord and C. B. Wilson. The Mathematical Description of Shape and Form. Ellis Horwood Limited, West Sussex, England, 1984.
	Mon91	John Montroll. African Animals in Origami. Dover Publications, 1991.
	Mon93	John Montroll. Origami Inside-Out. Dover Publications, 1993.

CITED BY 4

	Oswin Aichholzer , Franz Aurenhammer , Belén Palop, Quickest paths, straight skeletons, and the city Voronoi diagram, Proceedings of the eighteenth annual symposium on Computational geometry, p.151-159, June 05-07, 2002, Barcelona, Spain
	Siu-Wing Cheng , Antoine Vigneron, Motorcycle graphs and straight skeletons, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.156-165, January 06-08, 2002, San Francisco, California
	Jyh-Ming Lien , Nancy M. Amato, Approximate convex decomposition of polygons, Proceedings of the twentieth annual symposium on Computational geometry, June 08-11, 2004, Brooklyn, New York, USA
	Jyh-Ming Lien , Nancy M. Amato, Approximate convex decomposition of polygons, Computational Geometry: Theory and Applications, v.35 n.1, p.100-123, August 2006