When can a net fold to a polyhedron?

Computational Geometry: Theory and Applications

Volumn 31, Issue 3, 2005, Pages 207-218

  Biedl, Therese ^a   Lubiw, Anna ^a   Sun, Julie ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational geometry; Folding; Net; Polyhedron

Indexed keywords

EID: 84867967336     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.12.004     Document Type: Article

References (20)

1. H. Alt, C. Knauer, G. Rote, and S. Whitesides On the complexity of the linkage reconfiguration problem Proceedings of the 19th Annual Symposium on Computational Geometry, San Diego 2003 164 170
2. E.M. Arkin, M.A. Bender, E.D. Demaine, M.L. Demaine, J.S.B. Mitchell, S. Sethia, and S.S. Skiena When can you fold a map? Computational Geometry 29 1 2004 23 46
3. B. Aronov, and J. O'Rourke Nonoverlap of the star unfolding Discrete Comput. Geom. 8 1992 219 250
4. M. Bern, E. Demaine, D. Eppstein, E. Kuo, A. Mantler, and J. Snoeyink Ununfoldable polyhedra with convex faces Comput. Geom. 24 2 2003 51 62
5. T. Biedl, T. Chan, E. Demaine, M. Demaine, P. Nijjar, R. Uehara, and M.-W. Wang Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles Proceedings of the 14th Canadian Conference on Computational Geometry 2002 105 108
6. T. Biedl, E. Demaine, M. Demaine, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, and S. Whitesides Unfolding some classes of orthogonal polyhedra Proceedings of the 10th Canadian Conference on Computational Geometry 1998 70 71
7. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides Locked and unlocked polygonal chains in 3D Discrete Comput. Geom. 26 3 2001 283 287
8. T. Biedl, A. Lubiw, and J. Sun When can a net fold to a polyhedron? Proceedings of the 11th Canadian Conference on Computational Geometry 1999 1 4
9. J. Cantarella, and H. Johnston Non-trivial embeddings of polygonal intervals and unknots in 3-space J. Knot Theory Ramifications 7 8 1998 1027 1039
10. H.S.M. Coxeter Regular Polytopes 1963 The Macmillan Company
11. P.R. Cromwell Polyhedra 1997 Cambridge Univ. Press Cambridge
12. M. Donoso, and J. O'Rourke Nonorthogonal polyhedra built from rectangles 14th Canadian Conference on Computational Geometry 2002 97 100
13. A. Dürer Unterweysung der Messung mit dem Zirckel uñ richtscheyt in Linien ebnen unnd ganzen corporen, Nürnberg, 1525, Translated and with a commentary by Walter L. Strauss in "The Painter's Manual" 1977 Abaris Books New York
14. E. Demaine, D. Eppstein, J. Erickson, G. Hart, and J. O'Rourke Vertex-unfolding of simplicial manifolds Proceedings of the 18th Annual ACM Symposium on Computational Geometry 2002 237 243
15. E. Demaine, and J.S.B. Mitchell Reaching folded states of a rectangular piece of paper Proceedings of the 13th Canadian Conference on Computational Geometry 2001 73 75
16. H. Edelsbrunner Algorithms in Combinatorial Geometry 1988 Springer Berlin
17. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
18. A. Lubiw, J. O'Rourke, When can a polygon fold to a polytope?, Technical Report 048, Smith College, 1996
19. W.J. Lenhart, and S.H. Whitesides Reconfiguring closed polygonal chains in Euclidean d-space Discrete Comput. Geom. 13 1995 123 140
20. G.C. Shephard Convex polytopes with convex nets Math. Proc. Camb. Philos. Soc. 78 1975 389 403