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

Computational Geometry: Theory and Applications

Volumn 16, Issue 1, 2000, Pages 3-21

  Demaine, Erik D ^a   Demaine, Martin L ^a   Mitchell, Joseph S B ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Stony Brook University   (United States)

Author keywords

Convex decomposition; Hamiltonian triangulation; Origami design; Paper folding; Polyhedra; Polyhedral surfaces; Straight skeleton

Indexed keywords

EID: 0346385901     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00056-5     Document Type: Article

References (21)

1. O. Aichholzer, F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, in: Proceedings of the 2nd Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 1090, Hong Kong, 1996, pp. 117-126.
2. O. Aichholzer, F. Aurenhammer, D. Alberts, B. Gärtner, A novel type of skeleton for polygons, J. Universal Comput. Sci. 1 (1995) 752-761.
3. J. Akiyama, Why Taro can do geometry, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, p. 112. Invited talk.
4. J. Akiyama, T. Ooya, Y. Segawa, Wrapping a cube, Teaching Mathematics and Its Applications 16 (1997) 95-100.
5. E.M. Arkin, S.P. Fekete, J.S.B. Mitchell, Approximation algorithms for lawn mowing and milling, Technical Report 97.255, Angewandte Mathematik und Informatik, Universität zu Köln, 1997. Submitted to Computational Geometry.
6. E.M. Arkin, M. Held, J.S.B. Mitchell, S.S. Skiena, Hamiltonian triangulations for fast rendering, The Visual Computer 12 (1996) 429-444.
7. M. Bern, B. Hayes, The complexity of flat origami, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, 1996, pp. 175-183.
8. B. Chazelle, D.P. Dobkin, Optimal convex decompositions, in: G.T. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 63-133.
9. D. Eppstein, J. Erickson, Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions, in: Proceedings of the 14th Annual ACM Symposium on Computational Geometry, Minneapolis, MN, 1998, pp. 58-67.
10. D.H. Greene, The decomposition of polygons into convex parts, in: F.P. Preparata (Ed.), Computational Geometry, JAI Press, London, 1983, pp. 235-259.
11. T. Hasegawa, Magical Origami: Alphabets and Numerals, Seibundoh Shinkosha, 1996.
12. K. Kasahara, Origami Omnibus, Japan Publications, Inc., 1988.
13. K. Kasahara, T. Takahama, Origami for the Connoisseur, Japan Publications, Inc., 1987.
14. J.M. Keil, Polygon decomposition, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, Chapter 11, pp. 491-518.
15. J.M. Keil, Decomposing polygons into simpler components, Ph.D. Thesis, University of Toronto, Toronto, Canada, 1983.
16. J.M. Keil, Decomposing a polygon into simpler components, SIAM J. Comput. 14 (1985) 799-817.
17. R.J. Lang, A computational algorithm for origami design, in: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, Philadelphia, PA, 1996, pp. 98-105.
18. A. Lingas, The power of non-rectilinear holes, in: Proceedings of the 9th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 140, Springer, Aarhus, Denmark, 1982, pp. 369-383.
19. E.A. Lord, C.B. Wilson, The Mathematical Description of Shape and Form, Ellis Horwood Limited, West Sussex, England, 1984.
20. J. Montroll, African Animals in Origami, Dover Publications, 1991.
21. J. Montroll, Origami Inside-Out, Dover Publications, 1993.