Abstract
We consider one of the problems of the theory of flexible polyhedra—the problem about the number of the parameters that must be defined additionally to the edge lengths for a polyhedron of a given combinatorial type in order to exclude its possible bendings. We give a description for the combinatorial structure of polyhedra of spherical type for which this number is equal to 1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Maksimov I. G. and Sabitov I. Kh., “On the notion of the combinatorial p-parameter property for polyhedra,” Siberian Math. J., 43, No. 4, 661–673 (2002).
Gluck H., “Almost all simply connected closed surfaces are rigid,” in: Lecture Notes in Math., Springer-Verlag, Berlin, 438, 1975, pp. 225–239.
Sabitov I. Kh., “Algorithmic testing of the rigidity of suspensions,” Ukrain. Geom. Sb., 30, 109–111 (1987).
Maksimov I. G., “Description of the structure of algorithmically 1-parametric polyhedra and study of their rigidity,” submitted to VINITI, 2008, No. 518-B 2008.
Lawrenchenko S., Negami S., and Sabitov I. Kh., “A simpler construction of volume polynomials for a polyhedron,” Beitr. Algebra Geom., 43, No. 1, 261–273 (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2012 Maksimov I.G.
The author was supported by the Russian Foundation for Basic Research (Grants 09-01-00179; 12-01-00718).
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 53, No. 4, pp. 892–910, July–August, 2012.
Rights and permissions
About this article
Cite this article
Maksimov, I.G. Description of the combinatorial structure of algorithmically 1-parametric polyhedra of spherical type. Sib Math J 53, 718–731 (2012). https://doi.org/10.1134/S0037446612040131
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446612040131