Abstract
A given pair of convex polygons α and β is said to be reversible if α and β have dissections into a common finite number of pieces which can be rearranged to form β and α respectively, under certain conditions. A polygon α is said to be reversible if there exists a polygon β such that the pair α and β is reversible. This paper discusses operators which preserve reversibility for polygons. All reversible polygons are classified into seven equivalence classes \(\mathfrak{P}_{i}\) (i = 1, 2, …, 7) under the equivalence relation ≡, where A ≡ B means that there exists some operator f such that B = f(A).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
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. In: Crelle, A.L. (ed.) Journal für Die Reine und Angewandte Mathematik, vol. 10, pp. 228–234. Taf. III. Walter de Gruyter, Berlin (1833)
Hilbert, D.: Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongreß zu Paris 1900. In: Horstmann, L. (ed.) Nachrichten von der Königl. Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, vol. 1900, pp. 253–297. Commissionverlag der Dieterich’schen Universitätsbuchhandlung, Göttingen (1900); Subsequently in Bulletin of the American Mathematical Society, vol. 8(10), pp. 437–479. American Mathematical Society, New York (1902)
Dehn, M.: Über den Rauminhalt. In: Klein, F., Dyck, W., Hilbert, D. (eds.) Mathematische Annalen, vol. 55(3), pp. 465–478. H. G. Teubner, Leipzig (1901)
Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press, New York (1997)
Frederickson, G.N.: Hinged Dissections: Swinging and Twisting. Cambridge University Press, New York (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 Co., Lexington (1963); translated and adapted from the first Russian edition by Henn, A.K., Watts, C.E (1956)
Dolbilin, N., Itoh, J., Nara, C.: Affine Classes of 3-Dimensional Parallelohedra - Their Parametrizations (in this volume)
Akiyama, J., Nakamura, G.: Congruent Dudeney Dissections of Triangles and Convex Quadrilaterals — All Hinge Points Interior to the Sides of the Polygons. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 43–63. Springer, Heidelberg (2003)
Akiyama, J., Sato, I., Seong, H.: On Reversibility among Parallelohedra. In: Márquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 14–28. Springer, Heidelberg (2012)
Akiyama, J., Seong, H.: A Criterion for Two Polygons to be Reversible (to be published)
Akiyama, J., Rappaport, D., Seong, H.: Decision Algorithm and Classification of Reversible Pairs of Polygons (to be published)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akiyama, J., Seong, H. (2013). Operators which Preserve Reversibility. In: Akiyama, J., Kano, M., Sakai, T. (eds) Computational Geometry and Graphs. TJJCCGG 2012. Lecture Notes in Computer Science, vol 8296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45281-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-45281-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45280-2
Online ISBN: 978-3-642-45281-9
eBook Packages: Computer ScienceComputer Science (R0)