Author:
Abel Zachary,Demaine Erik D.,Demaine Martin L.,Eisenstat Sarah,Lynch Jayson,Schardl Tao B.,Shapiro-Ellowitz Isaac
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Lecture Notes in Computer Science;B. Ballinger,2009
2. Biedl, T., Demaine, E., Demaine, M., 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 Applied Mathematics 117(1-3), 293–297 (2002)
3. Connelly, R., Demaine, E.D., Rote, G.: Infinitesimally locked self-touching linkages with applications to locked trees. In: Calvo, J., Millett, K., Rawdon, E. (eds.) Physical Knots: Knotting, Linking, and Folding of Geometric Objects in R3, pp. 287–311. American Mathematical Society (2002)
4. Lecture Notes in Computer Science;M. Berg de,2010
5. Demaine, E.D., Devadoss, S.L., Mitchell, J.S.B., O’Rourke, J.: Continuous foldability of polygonal paper. In: Proceedings of the 16th Canadian Conference on Computational Geometry, Montréal, Canada, pp. 64–67 (August 2004)