Abstract
In this talk, we discuss tessellabilities, reversibilities, and decomposabilities of polygons, polyhedra, and polytopes, where by the word “tessellability”, we mean the capability of the polytope to tessellate. Although these three concepts seem quite different, but there is a strong connection linking them. These connections will be shown when we consider the lattices of tilings in ℝ2 and tessellations in ℝ3, which can be regarded as discrete metric spaces. Many old and new results together with various research problems will be presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bolyai, F.: Tentamen juventutem. Marcos Vasarhelyini: Typis Collegii Refomatorum per Josephum et Simeonem Kali (1832) (in Latin)
Gerwien, P.: Zerschneidung jeder bliebigen Anzahl von gleichen geradlinigen Figuren in dieselben Stücke. Journal für die Reine und Angewandte Mathematik (Crelle’s Journal) 10, 228–234, Taf. III
Hilbert, D.: Mathematische Probleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse; Subsequently in Bulletin of the American Mathematical Society 8, 437–479 (1901-1902)
Dehn, M.: Über den Rauminhalt, Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, 345–354; Subsequently in Mathematische Annalen 55(3), 465–478 (1902)
Dudeney, H.: The Canterbury Puzzles. Thomas Nelson and Sons (1907)
Boltyanskii, V.G.: Equivalent and Equidecomposable Figures. D. C. Health and Co. (1963); Translated and adapted from the first Russian edition by A. K. Henn, C.E. Watts (1956)
Boltyanskii, V.G.: Hilbert’s Third Problem. V. H. Winston and Sons; translated by from the first Russian edition by A. Silverman (1978)
Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press (1997)
Frederickson, G.N.: Hinged Dissections: Swinging and Twisting. Cambridge University Press (2002)
Frederickson, G.N.: Piano-hinged Dissections: Time to Fold. Cambridge University Press (2006)
Akiyama, J., Nakamura, G.: Congruent dissections of triangles and quadrilaterals - All the hinge points are on the sides of the polygon. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollak Festschrift. Algorithms and Combinatorics, pp. 43–63. Springer (2003)
Fedorov, E.S.: An introduction to the theory of figures. In: Notices of the Imperial Mineralogical Society. St. Petersburg, Ser.2, vol. 21, pp. 1–279 (1885); republished with comments by Akad. Nauk. SSSR, Moscow (1953) (in Russian)
Alexandrov, A.D.: Convex polyhedra. Springer Monographs in Mathematics (2005)
Dolbilin, N., Itoh, J., Nara, C.: Geometric realization on affine equivalent 3-parallelohedra (to be published)
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., Kobayashi, M., Nakagawa, H., Nakamura, G., Sato, I.: Atoms for Parallelohedra. In: Pach, J., et al. (eds.) Geometry – Intuitive, Discrete and Convex. Bolyai Soc. Math., Studies, vol. 24, pp. 1–21. Springer, Heidelberg (2013)
Akiyama, J., Maehara, H., Nakamura, G., Sato, I.: Element Number of the Platonic Solids. Geometriae Dedicata 145, 181–193 (2010)
Akiyama, J., Hitotumatu, S., Sato, I.: Determination of the Element Numbers of Regular Polytopes. Geometriae Dedicata 159, 89–97 (2012)
Akiyama, J., Seong, H.: A Criterion for Two Polygons to be Reversible (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., Sato, I., Seong, H. (2013). Tessellabilities, Reversibilities, and Decomposabilities of Polytopes. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-40020-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40019-3
Online ISBN: 978-3-642-40020-9
eBook Packages: Computer ScienceComputer Science (R0)