P.I. Troshin
Kazan Federal University, Kazan, 420008 Russia
E-mail: paul.troshin@gmail.com
Received March 11, 2019
Full text pdf
DOI: 10.26907/2541-7746.2019.4.591-605
For citation: Troshin P.I. Regular tessellation of the Lobachevskii plane. Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2019, vol. 161, no. 4, pp. 591–605. doi: 10.26907/2541-7746.2019.4.591-605. (In Russian)
Abstract
This paper discusses a new algorithm for construction of regular tessellation of the Lobachevskii plane. The problems of combinatorial and topological arrangement of regular tessellations, finding the number of tiles in each layer of such tessellation, and implementation of the algorithm in the modern computer programming language were studied. The relevance of the study is determined, on the one hand, by the unceasing interest in hyperbolic geometry and, in particular, in tessellations within it. On the other hand, the relevance is due to the insufficient number of published algorithm descriptions and their implementations. The following methods were used:
In the course of the study, the following results were obtained:
The obtained results and observations made in this paper are important for construction of tessellations in hyperbolic geometry.
Keywords: regular tessellation, tiling, Lobachevskii plane, hyperbolic geometry, Schla¨fli symbol, group of motions, Beltrami–Klein model, tile, prototile
Acknowledgments. We thank the reviewers for their constructive and helpful feedback on the style of the manuscript. The study was supported by the Russian Foundation for Basic Research (project no. 1831-00295).
References
- Poincaré H. Théorie des groupes fuchsiens. Acta Math., 1882, vol. 1, pp. 1–62. (In French)
- Schattschneider D. The mathematical side of M.C. Escher. Not. AMS, 2010, vol. 57, no. 6, pp. 706–718.
- Coxeter H.S.M. Regular compound tessellations of the hyperbolic plane. Proc. R. Soc. London, Ser. A, 1964, vol. 278, no. 1373, pp. 147–167. doi: 10.1098/rspa.1964.0052.
- Tennant R.F. Constructing tessellations and creating hyperbolic art. Symmetry: Cult. Sci., 1992, vol. 3, no. 4, pp. 367–383.
- Magnus W. Noneuclidean Tesselations and Their Groups. New York, Acad. Press, 1974. 208 p.
- Beardon A.F. The Geometry of Discrete Groups. New York, Springer, 1983. 337 p.
- Levy S. Automatic generation of hyperbolic tilings. Leonardo, 1992, vol. 25, no. 3, pp. 349–354. doi: 10.2307/1575861.
- Epstein D.B.A., Cannon J., Levy S., Holt D., Patterson M., Thurston W. Word Processing in Groups. Boston, Jones Bartlett, 1992. 352 p.
- Dunham D. Hyperbolic symmetry. Comput. Math. Appl., 1986, vol. 12, nos. 1–2, pt. B, pp. 139–153. doi: 10.1016/0898-1221(86)90147-1.
- Albuquerque C.D., Palazzo R., Silva E.B. Topological quantum codes on compact surfaces with genus g ≥ 2 . J. Math. Phys., 2009, vol. 50, no. 2, art. 023513, pp. 1–20. doi: 10.1063/1.3081056.
- Sosov E.N. Geometriya Lobachevskogo i ee primenenie v spetsial’noi teorii otnositel’nosti [Lobachevskii Geometry and Its Application in Special Relativity Theory]. Kazan, Kazan. Fed. Univ., 2016. 84 p. (In Russian)
- Firer M., Silva E.B. On the behavior of growth of polygons in semi-regular hyperbolic tessellations. Cogent Math., 2017, vol. 4, no. 1, art. 1302790, pp. 1–10. doi: 10.1080/23311835.2017.1302790.
- Zamorzaeva E. Isohedral tilings by 8-, 10- and 12-gons for hyperbolic translation group of genus two. Bul. Acad. S¸tiin¸te Repub. Mold. Mat., 2018, no. 2, pp. 74–84.
- Ahara K., Akiyama Sh., Hayashi H., Komatsu K. Strongly nonperiodic hyperbolic tilings using single vertex configuration. Hiroshima Math. J., 2018, vol. 48, no. 2, pp. 133–140. doi: 10.32917/hmj/1533088825.
- Ouyang P., Cheng D., Cao Y., Zhan X. The visualization of hyperbolic patterns from invariant mapping method. Comput. Graphics, 2012, vol. 36, no. 2, pp. 92–100. doi: 10.1016/j.cag.2011.12.005.
- Chen N., Chung K.W. Efficient generation of hyperbolic patterns from a single asymmetric motif. Fractals, 2016, vol. 24, no. 4, art. 1650043. doi: 10.1142/S0218348X16500432.
The content is available under the license Creative Commons Attribution 4.0 License.