Abstract
A pair of convex polygons \(\alpha \) and \(\beta \) is said to be reversible if \(\alpha \) has a dissection into a finite number of hinged pieces which can be rearranged to form \(\beta \) under some conditions. In this paper, we give a necessary and sufficient condition for a given pair of polygons \(\alpha \), \(\beta \) to be reversible.
Similar content being viewed by others
References
Dudeney, H.E.: The Canterbury Puzzles and Other Curious Problems. W. Heinemann, London (1907)
Bolyai, F.: Tentamen juventutem studiosam in elementa matheseos puræ, elementaris ac sublimioris, methodo intuitiva, evidentiaque huic propria, introducendi, cum appendice triplici. Typis Collegii Reformatorum per Josephum, et Simeonem kali de felső Vist. Maros Vásárhelyini (1832–1833)
Gerwien, P.: Zerschneidung jeder beliebigen Anzahl von gleichen geradlinigen Figuren in dieselben Stücke. J. für die reine und angew. Math. 10, 228–234 (1833)
Hilbert, D.: Mathematische Probleme, Nachrichten von der Königl. Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-physikalische Klasse, pp. 253–297 (1900)
Dehn, M.: Über den Rauminhalt. Math. Ann. 55, 465–478 (1901)
Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press, Cambridge (1997)
Frederickson, G.N.: Hinged Dissections: Swinging and Twisting. Cambridge University Press, Cambridge (2002)
Frederickson, G.N.: Piano-Hinged Dissections: Time to Fold. A K Peters, Wellesley (2006)
Boltyanskii, V.G.: Equivalent and Equidecomposable Figures. D. C. Health and Company, Boston (1963). [translated and adapted from the first Russian edition (1956) by Henn, A.K. and Watts, C.E.]
Mirman, R.: Point Groups, Space Groups, Crystals. Molecules. World Scientific Publishing Co, Singapore (1999)
Akiyama, J., Nakamura, G.: Dudeney dissections of polygons and polyhedrons—a survey—. In: Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 2098, pp. 1–30 (2001)
Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of triangles and convex quadrilaterals—all hinge points interior to the sides of the polygons. discrete and computational geometry. Algorithms Comb. 25, 43–63 (2003)
Akiyama, J., Seong, H.: Operators which preserve reversibility. In: Computational Geometry and Graphs. Lecture Notes in Computer Science, vol. 8296, pp. 1–19 (2013)
Akiyama, J., Rappaport, D., Seong, H.: A decision algorithm for reversible pairs of polygons. Discret. Appl. Math. 178, 19–26 (2014)
Acknowledgments
The authors would like to thank the referees, Professor David Rappaport and Professor Joseph O’Rourke for giving us various important comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Akiyama, J., Seong, H. A Criterion for a Pair of Convex Polygons to be Reversible. Graphs and Combinatorics 31, 347–360 (2015). https://doi.org/10.1007/s00373-015-1544-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1544-3