Abstract
Some formulas are given that describe how the lengths of diagonals of algorithmically 1-para-metric polyhedra and their volumes depend on the bending parameter. By way of application, we present flexibility equations and prove the rigidity of an embedded gluing of two suspensions (bipyramids).
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, 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.
Connelly R., “An attack on rigidity. I, II,” Bull. Amer. Math. Soc., 81, 566–569 (1975).
Maksimov I. G., “Nonflexible polyhedra with small number of vertices,” J. Math. Sci. (New York), 149, No. 1, 956–970 (2008).
Sabitov I. Kh., “The volume of a polyhedron as a function of its metric,” Fundam. Prikl. Mat., 2, No. 4, 1235–1246 (1996).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2010 Maksimov I. G.
Rights and permissions
About this article
Cite this article
Maksimov, I.G. Study of flexible algorithmically 1-parametric polyhedra and description of a set of rigid embedded polyhedra. Sib Math J 51, 1081–1090 (2010). https://doi.org/10.1007/s11202-010-0106-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11202-010-0106-4