Hinged dissections exist

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 110-119

  Abbott, Timothy G ^a   Abel, Zachary ^b   Charlton, David ^c   Demaine, Erik D ^a   Demaine, Martin L ^b   Kominers, Scott D ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

^c BOSTON UNIVERSITY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

GRAPH THEORY;

EXPLICIT ALGORITHMS; HILBERT; HINGED DISSECTIONS; NANOMANUFACTURING; OPEN PROBLEMS; PROGRAMMABLE MATTERS; RECONFIGURABLE; RUNNING TIMES; THEORY;

COMPUTATIONAL GEOMETRY;

EID: 57349162748     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377695     Document Type: Conference Paper

References (36)

1. T. G. Abbott, Z. Abel, D. Charlton, E. D. Demaine, M. L. Demaine, and S. D. Kominers, Hinged dissections exist. arXiv:cs.CG/0712.2094, 2007, http://arxiv.org/abs/0712.2094.
2. J. Akiyama and G. Nakamura. Dudeney dissection of polygons. In Revised Papers from the Japan Conf. Discrete Comput Geom., LNCS 1763, pp. 14-29, 1998.
3. J. Akiyama, G. Nakamura, A. Nozaki, K. Ozawa, and T. Sakai. The optimality of a certain purely recursive dissection for a sequentially n-divisible square. Comput. Geom. Theory Appl., 24(l):27-39, 2003.
4. F. Bolyai. Teniamen juventutem studiosam in elernenta matheseos purae, elementaris ac sublimioris. methodo intuitiva, evideniiaque huic propria, introducendi. Typis Collegii Refomatorum per Josephum et Simeonem Kali, Maros Vásárhcly, 1832-1833.
5. C. Burnikel, S. Funkc, K. Mchlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In Proc. 9th European Sympos. Algorithms, LNCS 2161, pp. 254-265, 2001.
6. B. Chazelle. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAAM J. Comput., 13(3):488-507, 1984.
7. M. J. Cohn. Economical triangle-square dissection. Geom. Dedicate 3:447-467, 1975.
8. R. Connelly, E. D. Demaine, M. L. Demaine, S. Fckete, S. Langerman, J. S. B. Mitchell, A. Ribo, and G. Rote. Locked and unlocked chains of planar shapes. In Proc. 22nd ACM Sympos. Comput. Geom., pp. 61-70, 2006.
9. R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. Discrete Comput. Geom., 30(2):205-239, 2003.
10. J. Czyzowicz, E. Kranakis, and J. Urrutia. Dissections, cuts, and triangulations. In Proc. 11th Canad. Conf. Comput. Geom,., 1999.
11. M. Dchn. Übcr den Rauminhalt. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathem.aiisch-Physikalische Klasse, pp. 345-354, 1900, Later in Math. Ann. 55:465-478, 1902.
12. E. D. Demaine, M. L. Demaine, D. Eppstein, G. N. Frederickson, and E. Friedman. Hinged dissection of polyominocs and polyforms. Comput, Geom. Theory AppL, 31(3):237-262, 2005.
13. E. D. Demaine, M. L. Demaine, J. F. Lindy, and D. L. Souvainc. Hinged dissection of polypolyhcdra. In Proc. 9th Workshop Algorithms Data Struct., LNCS 3608, pp. 205-217, 2005.
14. E. D. Demaine, J. S. Mitchell, and J. O'Rourke. Problem 47: Hinged dissections. In The Open Problems Project. March 2003. http://www.cs.smith.edu/-orourke/TOPP/P47.html.
15. H. E. Dudcncy. Puzzles and prizes. Weekly Dispatch. April 6-May 4, 1902.
16. J. L. Dupont and C.-H. Sah. Homology of Euclidean groups of motions made discrete and Euclidean scissors congruences. Acta Math., 164(l):l-27, 1990.
17. D. Eppstein. Hinged kite mirror dissection. arXiv:cs.CG/0106032, June 2001.
18. G. N. Frederickson. Dissections: Plane and. Fancy. Cambridge University Press, November 1997.
19. G. N. Frederickson. Hinged Dissections: Swinging & Twisting. Cambridge University Press, August 2002.
20. P, Gerwicn. Zcrschneidung jeder bclicbigcn Anzahl von gleichen geradlinigen Figuren in dieselben Stücke. J. Reine Angew. Math., 10:228-234 and Taf. III, 1833.
21. S. Griffith. Growing Machines. PhD thesis, Media Lab. MIT, 2004.
22. B. .lessen. The algebra of polyhedra and the Dehn-Sydler theorem. Math. Scand., 22:241-256, 1968.
23. P. Kelland. On superposition, part II. Trans. Royal Soc. Edinburgh, 33:471-473 and plate XX, 1864.
24. E. Kranakis, D. Krizanc, and J. Urrutia. Efficient regular polygon dissections. Geom. Dedicata, 80:247-262, 2000.
25. D. Lemon. The Illustrated Book of Puzzles. Saxon, London, 1890.
26. H. Lindgren. Recreational Problems in Geometric Dissections and How to Solve Them. Dover, 1972.
27. M. Lowry. Solution to question 269, [proposed] by Mr. W. Wallace. In T. Leybourn, ed., Mathematical Repository, vol, 3, part 1, pp. 44-46. W. Glcndinning, London, 1814.
28. J. S. Madachy. Geometric dissections. In Madachy's Mathematical Recreations, ch. 1, pp. 15-33. Dover Publications, 1979.
29. 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. J. Amer. Chem. Soc., 124:14508-14509, 2002.
30. J. O'Rourke. Computational geometry column 44. Internat. J. Comput. Geom. Appl., 13(3):273-275, 2002.
31. J. Ozanam. Récréations Mathématiques et Physiques, pp. 297-302. Claude Antoine Jombert, fils, Paris, 1778. According to 18, this material was added by J. Montucla under the pseudonym M, dc Chanla.
32. A.-J. Panckoucke. Les Amusemens Mathématiques. Chez André-Joseph Panckoucke, Lille, 1749.
33. D. Rus, Z. Butler, K. Kotay, and M. Vona. Self-reconfiguring robots. Comm. ACM, 45(3):39-45, 2002.
34. I. Streinu. Pseudo-triangulations, rigidity and motion planning. Discrete Comput. Geom., 34(4):587-635, November 2005,
35. J.-P. Sydler. Conditions nécessaires et suffisantes pour l'équivalcncc des polyèdres de 1'espace euclidien à trois dimensions. Comment. Math. Helv., 40:43-80, 1965.
36. W. Wallace, editor. Elements of Geometry. Bell & Bradfute, Edinburgh, 8th edition, 1831.