Locked and unlocked chains of planar shapes

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 61-70

  Connelly, Robert ^a   Demaine, Erik D ^b   Demaine, Martin L ^b   Fekete, Sándor P ^c   Langerman, Stefan ^d   Mitchell, Joseph S B ^e   Ribó, Ares ^f   Rote, Günter ^f  

^a Department of Obstetrics Gynecology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^d UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^e STONY BROOK UNIVERSITY   (United States)

^f FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Folding; Hinged dissections; Linkages; Locked chains

Indexed keywords

COMPUTATIONAL METHODS;

HINGED DISSECTIONS; LINKAGES; LOCKED CHAINS; PLANAR SHAPES;

COMPUTATIONAL GEOMETRY;

EID: 33748042634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137868     Document Type: Conference Paper

References (15)

1. J. Akiyama and G. Nakamura. Dudeney dissection of polygons. In Revised Papers from the Japan Conference on Discrete and Computational Geometry, volume 1763 of Lecture Notes in Computer Science, pages 14-29, Tokyo, Japan, December 1998.
2. H. Alt, C. Knauer, G. Rote, and S. Whitesides. On the complexity of the linkage reconfiguration problem. In J. Pach, editor, Towards a Theory of Geometric Graphs, volume 342 of Contemporary Mathematics, pages 1-14. American Mathematical Society, 2004.
3. J. H. Cantarella, E. D. Demaine, H. N. Iben, and J. F. O'Brien. An energy-driven approach to linkage unfolding. In Proceedings of the 20th Annual ACM Symposium on Computational Geometry, pages 134-143, Brooklyn, New York, June 2004.
4. J.-S. Cheong, A. F. van der Stappen, K. Goldberg, M. H. Overmars, and E. Rimon. Immobilizing hinged polygons. International Journal of Computational Geometry and Applications. To appear.
5. R. Connelly, E. D. Demaine, and G. Rote. Infinitesimally locked self-touching linkages with applications to locked trees. In J. Calvo, K. Millett, and E. Rawdon, editors, Physical Knots: Knotting, Linking, and Folding of Geometric Objects in 3-space, pages 287-311. American Mathematical Society, 2002.
6. R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. Discrete & Computational Geometry, 30(2):205-239, September 2003.
7. P. R. Cromwell. Equality, rigidity, and flexibility. In Polyhedra, chapter 6, pages 219-247. Cambridge University Press, 1997.
8. E. D. Demaine, M. L. Demaine, D. Eppstein, G. N. Frederickson, and E. Friedman. Hinged dissection of polyominoes and polyforms. Computational Geometry: Theory and Applications, 31(3):237-262, June 2005.
9. E. D. Demaine, M. L. Demaine, J. F. Lindy, and D. L. Souvaine. Hinged dissection of polypolyhedra. In Proceedings of the 9th Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science, pages 205-217, Waterloo, Canada, August 2005.
10. H. E. Dudeney. Puzzles and prizes. Weekly Dispatch, 1902. The puzzle appeared in the April 6 issue of this column, and the solution appeared on May 4.
11. D. Eppstein. Hinged kite mirror dissection. arXiv:cs.CG/0106032, June 2001.
12. G. N. Frederickson. Hinged Dissections: Swinging & Twisting. Cambridge University Press, August 2002.
13. C. Mao, V. R. Thallidi, D. B. Wolfe, S. Whitesides, and G. M. Whitesides. Dissections: Self-assembled aggregates that spontaneously reconfigure their structures when their environment changes. Journal of the American Chemical Society, 124:14508-14509, 2002.
14. J. H. Reif. Complexity of the mover's problem and generalizations. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pages 421-427, 1979.
15. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 443-453, Redondo Beach, California, November 2000.