Robust Tensegrity Polygons |
| |
Authors: | János Geleji Tibor Jordán |
| |
Affiliation: | 1. Department of Operations Research, E?tv?s University, Pázmány Péter sétány 1/C, Budapest, 1117, Hungary
|
| |
Abstract: | A tensegrity polygon is a planar cable-strut tensegrity framework in which the cables form a convex polygon containing all vertices. The underlying edge-labeled graph $T=(V;C,S)$ T = ( V ; C , S ) , in which the cable edges form a Hamilton cycle, is an abstract tensegrity polygon. It is said to be robust if every convex realization of T as a tensegrity polygon has an equilibrium stress which is positive on the cables and negative on the struts, or equivalently, if every convex realization of T is infinitesimally rigid. We characterize the robust abstract tensegrity polygons on n vertices with $n-2$ n - 2 struts, answering a question of Roth and Whiteley (Trans Am Math Soc 265:419–446, 1981) and solving an open problem of Connelly (Recent progress in rigidity theory, 2008). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|