This article is cited in 1 paper

Description of the combinatorial structure of algorithmically $1$-parametric polyhedra of spherical type

I. G. Maksimov

Ministry for Education of the Moscow Region, Krasnogorsk, Russia

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$.

Keywords: flexible polyhedron, bending, algorithm.

UDC: 514.113+514.772.35

Received: 04.09.2009
Revised: 14.11.2011

 English version: Siberian Mathematical Journal, 2012, 53:4, 718–731

Bibliographic databases:

• 
• 
•