maisМоделирование и анализ информационных системModeling and Analysis of Information Systems1818-10152313-5417Yaroslavl State University10.18255/1818-1015-2012-6-127-136mais-147Research ArticleОригинальные статьиArticlesНепрерывное уплощение правильного тетраэдра точными отображениямиContinuous Flattening of a Regular Tetrahedron with Explicit MappingsИтоДжин-ичиItohJin-ichi

профессор факультета образования

профессор факультета образования

j-itoh@kumamoto-u.ac.jpНараЧиNaraChie

профессор Образовательного центра свободных искусств

профессор Образовательного центра свободных искусств

cnara@ktmail.tokai-u.jpУниверситет КумамотоЯпонияKumamoto UniversityJapanТокийский университетЯпонияTokai UniversityJapan201212032015196127136Copyright © Ито Д., Нара Ч., 20152015Ито Д., Нара Ч.Itoh J., Nara C.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://www.mais-journal.ru/jour/article/view/147

В статье [10] нами доказано, что любой правильный многогранник P допускает непрерывное (изометричное) складывание (или разглаживание) на плоскость. В настоящей статье мы приводим явные формулы непрерывных функций такого процесса складывания для правильного тетраэдра в R³ . Статья публикуется в авторской редакции.

We proved in [10] that each Platonic polyhedron P can be folded into a flat multilayered face of P by a continuous folding process of polyhedra. In this paper, we give explicit formulas of continuous functions for such a continuous flattening process in R³ for a regular tetrahedron.

The article is published in the author’s wording.

непрерывное складываниеправильные тетраэдрымногогранникискладывание бумагиContinuous FlatteningRegular TetrahedraPolyhedraPaper FoldingGrand-in-Aid for Scientific Research (No.23540098), JSPS; Grand-in-Aid for Scientific Research (No.23540160), JSPSReferencesA. D. Alexandrov, “ Convex Polyhedra,” Springer-Verlag, Berlin, 2005. Monographs in Mathematics. Translation of the 1950 Russian edition by N. S. Dairbekov, S. S. Kutateladze, and A. B. Sossinsky.A. D. Alexandrov, “ Convex Polyhedra,” Springer-Verlag, Berlin, 2005. Monographs in Mathematics. Translation of the 1950 Russian edition by N. S. Dairbekov, S. S. Kutateladze, and A. B. Sossinsky.T. Banchoff, “Nonrigidity theorem for tight polyhedra,” Arch. Math. 21, 416–423, 1970.T. Banchoff, “Nonrigidity theorem for tight polyhedra,” Arch. Math. 21, 416–423, 1970.D. Bleecker, “Volume increasing isometric deformations of convex polyhedra,” J. Differential Geom. 43, 505–526, 1996.D. Bleecker, “Volume increasing isometric deformations of convex polyhedra,” J. Differential Geom. 43, 505–526, 1996.A. Cauchy, “Sur les polygons et les polyedres,” J. Ecole Polytech. 9, 87, 1813.A. Cauchy, “Sur les polygons et les polyedres,” J. Ecole Polytech. 9, 87, 1813.R. Connelly, “A counterexample to the rigidity conjecture for polyhedra,” Inst. Hautes Etudes Sci. Publ. Math. 47, 333–338, 1978.R. Connelly, “A counterexample to the rigidity conjecture for polyhedra,” Inst. Hautes Etudes Sci. Publ. Math. 47, 333–338, 1978.R. Connelly, “The rigidity of polyhedral surface,” Math. Mag. 52, 275–283, 1979.R. Connelly, “The rigidity of polyhedral surface,” Math. Mag. 52, 275–283, 1979.E. D. Demaine, M. D. Demaine and A. Lubiw, “Flattening polyhedra,” Unpublished manuscript, 2001.E. D. Demaine, M. D. Demaine and A. Lubiw, “Flattening polyhedra,” Unpublished manuscript, 2001.E. D. Demaine and J. O’Rourke, “ Geometric folding algorithms, Lincages, Origami, Polyhedra,” Cambridge University Press, 2007.E. D. Demaine and J. O’Rourke, “ Geometric folding algorithms, Lincages, Origami, Polyhedra,” Cambridge University Press, 2007.K. Hirata, Private communication, 2011.K. Hirata, Private communication, 2011.J. Itoh and C. Nara, “Continuous flattening of Platonic polyhedra,” Proceedings of the international conference “Computational geometry, graphs and applications,” LNCS 7033, 108–121, Springer, 2011.J. Itoh and C. Nara, “Continuous flattening of Platonic polyhedra,” Proceedings of the international conference “Computational geometry, graphs and applications,” LNCS 7033, 108–121, Springer, 2011.J. Itoh, C. Nara and C. Vîlcu, “Continuous flattening of convex polyhedra,” XIV Spanish meeting on computational geometry, EGC 2011 “Computational Geometry,” LNCS 7579, 85–97, Springer, 2012.J. Itoh, C. Nara and C. Vîlcu, “Continuous flattening of convex polyhedra,” XIV Spanish meeting on computational geometry, EGC 2011 “Computational Geometry,” LNCS 7579, 85–97, Springer, 2012.A. Milka, “Linear bendings of regular convex polyhedra,” Matematicheskaya Fizika, Analiz, Geometriya 1, 116–130, 1994.A. Milka, “Linear bendings of regular convex polyhedra,” Matematicheskaya Fizika, Analiz, Geometriya 1, 116–130, 1994.I. Pak, “Inflating the cube without stretching,” Amer. Math. Monthly 115, 443–445, 2008.I. Pak, “Inflating the cube without stretching,” Amer. Math. Monthly 115, 443–445, 2008.I. Sabitov, “The volume of polyhedron as a function of its metric,” Fundam. Prikl. Mat. 2(4), 1235–1246, 1996.I. Sabitov, “The volume of polyhedron as a function of its metric,” Fundam. Prikl. Mat. 2(4), 1235–1246, 1996.I. Sabitov, “The volume as a metric invariant of polyhedra,” Discrete Comput. Geom. 20, 405–425, 1998.I. Sabitov, “The volume as a metric invariant of polyhedra,” Discrete Comput. Geom. 20, 405–425, 1998.I. Sabitov, “On some recent results in the metric theory of polyhedra,” Rend. Circ. Mat. Palermo (2) Suppl. No. 65, part II, 167–177, 2000.I. Sabitov, “On some recent results in the metric theory of polyhedra,” Rend. Circ. Mat. Palermo (2) Suppl. No. 65, part II, 167–177, 2000.

The authors declare that there are no conflicts of interest present.