Robust Tensegrity Polygons

János Geleji, Tibor Jordán

Research output: Article

2 Citations (Scopus)

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), 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 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).

Original languageEnglish
Pages (from-to)537-551
Number of pages15
JournalDiscrete and Computational Geometry
Volume50
Issue number3
DOIs
Publication statusPublished - okt. 1 2013

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Robust Tensegrity Polygons'. Together they form a unique fingerprint.

  • Cite this