Abstract
An example of reversible (or hinge inside-out transformable) figures is the Dudeney’s Haberdasher’s puzzle in which an equilateral triangle is dissected into four pieces, then hinged like a chain, and then is transformed into a square by rotating the hinged pieces. Furthermore, the entire boundary of each figure goes into the inside of the other figure and becomes the dissection lines of the other figure. Many intriguing results on reversibilities of figures have been found in prior research, but most of them are results on polygons. This paper generalizes those results to a wider range of general connected figures. It is shown that two nets obtained by cutting the surface of an arbitrary convex polyhedron along non-intersecting dissection trees are reversible. Moreover, a condition for two nets of an isotetrahedron to be both reversible and tessellative is given.
S. Langerman—Directeur de Recherches du F.R.S.-FNRS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abbott, T., Abel, Z., Charlton, D., Demaine, E.D., Demaine, M.L., Kominers, S.: Hinged dissections exist. Discrete Comput. Geom. 47(1), 150–186 (2010)
Akiyama, J.: Tile-maker and semi-tile-maker. Am. Math. Mon. 114, 602–609 (2007)
Akiyama, J., Matsunaga, K.: Treks into Intuitive Geometry. Springer, New York (2015)
Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of triangles and convex quadrangles - all hinge points interior to the sides of the polygons. In: Pach, J., Aronov, B., Basu, S., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol. 25, pp. 43–63. Springer, New York (2003)
Akiyama, J., Rappaport, D., Seong, H.: A decision algorithm for reversible pairs of polygons. Discrete Appl. Math. 178, 19–26 (2014)
Akiyama, J., Seong, H.: A criterion for a pair of convex polygons to be reversible. Graphs Comb. 31(2), 347–360 (2015)
Akiyama, J., Tsukamoto, T.: Envelope magic (to appear)
Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete Comput. Geom. 8(3), 219–250 (1992)
Demaine, E.D., Demaine, M.L., Eppstein, D., Frederickson, G.N., Friedman, E.: Hinged dissection of polynominoes and polyforms. Comput. Geom. Theory Appl. 31(3), 237–262 (2005)
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)
Frederickson, G.N.: Hinged Dissections: Swinging and Twisting. Cambridge University Press, Cambridge (2002)
Itoh, J., Nara, C.: Transformability and reversibility of unfoldings of doubly-covered polyhedra. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 77–86. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Akiyama, J., Langerman, S., Matsunaga, K. (2016). Reversible Nets of Polyhedra. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science(), vol 9943. Springer, Cham. https://doi.org/10.1007/978-3-319-48532-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-48532-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48531-7
Online ISBN: 978-3-319-48532-4
eBook Packages: Computer ScienceComputer Science (R0)