The complexity of a pop-up book

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 3-6

  Uehara, Ryuhei ^a   Teramoto, Sachio ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Computational Complexity; Origami; Paper folding; Pop up books

Indexed keywords

COMPUTATIONAL COMPLEXITY;

DESIGN PROBLEMS; NP-HARD; ORIGAMI; PAPER FOLDING; POP-UP BOOKS;

COMPUTATIONAL GEOMETRY;

EID: 80051862013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. M. Bern and B. Hayes. The Complexity of Flat Origami. In Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 175–183. ACM, 1996.
2. E. D. Demaine and M. L. Demaine. Recent Results in Computational Origami. In Proceedings of the 3rd International Meeting of Origami Science, Math, and Education (OSME 2001), pages 3–16, 2001.
3. E. D. Demaine and J. O’Rourke. A Survey of Folding and Unfolding in Computational Geometry In Combinatorial and Computational Geometry, Volume 52 of Mathematical Sciences Research Institute Publications, pages 167–211. Cambridge University Press, 2005.
4. M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, 1979.
5. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides. Movement Problems for 2-Dimensional Linkages. SIAM J. Comput., 13:610–629, 1984.
6. P. Jackson. The Pop-up Book. Owl Books, 1993.
7. R. J. Lang. Origami Design Secrets. A K Peters LTD, 2003.
8. R. Sabuda. Winter’s Tale: An Original Pop-up Journey. Little Simon, 2005.