|
This article is cited in 4 scientific papers (total in 4 papers)
Research Papers
Junction of noncomposite polygons
A. V. Timofeenko Institute of Computational Modelling, Siberian Branch of the Russian Academy of Sciences, Krasnoyarsk, Russia
Abstract:
All 3-dimensional convex regular-hedra are found, i.e., the convex polyhedra having positive curvature of each vertex and such that every face is either a regular polygon or is composed of two regular polygons. The algorithm for constructing such solids is based on calculation of the corresponding symmetry groups and gives a listing of all possible adjoins along entire faces of convex regular-hedra that cannot be cut by any plane into smaller regular-hedra.
Received: 31.08.2008
Citation:
A. V. Timofeenko, “Junction of noncomposite polygons”, Algebra i Analiz, 21:3 (2009), 165–209; St. Petersburg Math. J., 21:3 (2010), 483–512
Linking options:
https://www.mathnet.ru/eng/aa1144 https://www.mathnet.ru/eng/aa/v21/i3/p165
|
|