Information Technology Reference
In-Depth Information
Fig. 7.
Magnified view of a flat folding that cannot be obtained by crimping
Acknowledgements.
This research was performed in part at the 29th Bellairs
Winter Workshop on Computational Geometry. Erik Demaine thanks Ilya Baran
and Muriel Dulieu, and the authors of [2], for many discussions attempting to
solve this problem. We also thank Jason Ku for helpful comments on a draft
of this paper. Erik Demaine was supported in part by NSF ODISSEI grant
EFRI-1240383 and NSF Expedition grant CCF-1138967. David Eppstein was
supported in part by NSF grant 1228639 and ONR grant N00014-08-1-1015.
References
1. Abbott, T.G., Demaine, E.D., Gassend, B.: arXiv:0901.1322 (January 2009),
2. Abel, Z., Demaine, E.D., Demaine, M.L., Eisenstat, S., Lynch, J., Schardl, T.B.,
Shapiro-Ellowitz, I.: Folding equilateral plane graphs. Internat. J. Comput. Geom.
Appl. 23(2), 75-92 (2013)
3. Alt, H., Knauer, C., Rote, G., Whitesides, S.: On the complexity of the linkage
reconfiguration problem. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs,
Contemp. Math., vol. 342, pp. 1-13. Amer. Math. Soc., Providence (2004)
4. Arkin, E.M., Bender, M.A., Demaine, E.D., Demaine, M.L., Mitchell, J.S.B.,
Sethia, S., Skiena, S.S.: When can you fold a map? Comput. Geom. Th. Appl. 29(1),
23-46 (2004)
5. Ballinger, B., Charlton, D., Demaine, E.D., Demaine, M.L., Iacono, J., Liu, C.-H.,
Poon, S.-H.: Minimal locked trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., Toth,
C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 61-73. Springer, Heidelberg (2009)
6. Bern, M., Hayes, B.: The complexity of flat origami. In: Proc. 7th ACM-SIAM
Symposium on Discrete Algorithms (SODA 1996), pp. 175-183 (1996)
7. Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of tri-
connected digraphs. Algorithmica 12(6), 476-497 (1994)
8. Biedl, T., Demaine, E.D., Demaine, M.L., Lazard, S., Lubiw, A., O'Rourke, J.,
Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A note on reconfiguring tree
linkages: trees can lock. Discrete Appl. Math. 117(1-3), 293-297 (2002)
9. Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified
edge lengths. J. Graph Algorithms & Appl. 11(1), 259-276 (2007)
10. Connelly, R., Demaine, E.D., Rote, G.: Infinitesimally locked self-touching linkages
with applications to locked trees. In: Physical Knots: Knotting, Linking, and Fold-
ing Geometric Objects in
R
3
(Las Vegas, NV, 2001). Contemp. Math., vol. 304,
pp. 287-311. Amer. Math. Soc., Providence (2002)
11. Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexi-
fying polygonal cycles. Discrete & Computational Geometry 30(2), 205-239 (2003)
