Abstract
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two noncrossing nets of a common polyhedron. Furthermore, monotone reversible hinged dissections (where all hinges rotate in the same direction when changing from A to B) correspond exactly to noncrossing nets of a common convex polyhedron. By envelope/parcel magic, it becomes easy to design many hinged dissections.
Similar content being viewed by others
Notes
For simplicity, we assume that the edges of T are drawn using segments along the surface of P, and that vertices of degree 2 can be used in T to draw any polygonal path.
We here refer to the geodesic distance on the surface of P.
References
Abbott, T.G., Abel, Z., Charlton, D., Demaine, E.D., Demaine, M.L., Kominers, S.D.: Hinged dissections exist. Discrete Comput. Geom. 47(1), 150–186 (2012)
Akiyama, J., Langerman, S., Matsunaga, K.: Reversible nets of polyhedra. In: Revised Papers from the 18th Japan Conference on Discrete and Computational Geometry and Graphs, Kyoto, pp. 13–23 (2015)
Akiyama, J., Nakamura, G.: Dudeney dissection of polygons. In: Revised Papers from the Japan Conference on Discrete and Computational Geometry, Tokyo, Lecture Notes in Computer Science, vol. 1763, pp. 14–29 (1998)
Akiyama, J., Seong, H.: A criterion for a pair of convex polygons to be reversible. Graphs Comb 31(2), 347–360 (2015)
Alexandrov, A.D.: Convex Polyhedra. Springer, Berlin (2005). (Translation of Russian edition, 1950)
Burago, YuD, Zalgaller, V.A.: Isometric piecewise linear immersions of two-dimensional manifolds with polyhedral metrics in \(\mathbb{R}^3\). St. Petersb. Math. J. 7, 369–385 (1996). (Translation by S.V. Ivanov)
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)
Dudeney, H.E.: Puzzles and Prizes. Weekly Dispatch (1902) (The puzzle appeared in the April 6 issue of this column. A discussion followed on April 20, and the solution appeared on May 4)
Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press, Cambridge (1997)
Frederickson, G.N.: Hinged Dissections: Swinging & Twisting. Cambridge University Press, Cambridge (2002)
Langerman, S., Winslow, A.: A complete classification of tile-makers. In: Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs, Kyoto (2015)
O’Rourke, J.: On folding a polygon to a polyhedron (2010). arXiv:1007.3181
Uehara, R.: A survey and recent results about common developments of two or more boxes. In: Origami\(^6\): Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education, vol. 1 (Mathematics), pp. 77–84. American Mathematical Society (2014)
Бураго, Ю.Д., Залгаллер, В.А.: Реализация разверток в виде многогранников (polyhedral embedding of a net). в е с т никЛГУ 15, 66–80 (1960) (in Russian with English summary)
Бураго, Ю.Д., Залгаллер, В.А.: Изометрические кусочно-линеЙные потружения двумерных многообразиЙ с полиэдральноЙ метрикоЙ в \(\mathbb{R}^3\). Алгебраианализ 7, 76–95 (1995) (in Russian, translation in [6])
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Akiyama, J., Demaine, E.D. & Langerman, S. Polyhedral Characterization of Reversible Hinged Dissections. Graphs and Combinatorics 36, 221–229 (2020). https://doi.org/10.1007/s00373-019-02041-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02041-2