TR-2012-05

Strongly Rigid Tensegrity Graphs on the Line

Bill Jackson, Tibor Jordán, Csaba Király

Published in:
Discrete Applied Mathematics 161:(7-8) pp. 1147-1149. (2013)



Abstract

Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, which provide upper and/or lower bounds for the distance between their endpoints. The graph of the framework, in which edges are labeled as bars, cables, and struts, is called a tensegrity graph. It is said to be strongly rigid in Rd if every generic realization in Rd as a tensegrity framework is infinitesimally rigid. In this note we show that it is NP-hard to test whether a given tensegrity graph is strongly rigid in R1.


Bibtex entry:

@techreport{egres-12-05,
AUTHOR = {Jackson, Bill and Jord{\'a}n, Tibor and Kir{\'a}ly, Csaba},
TITLE = {Strongly Rigid Tensegrity Graphs on the Line},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2012},
NUMBER = {TR-2012-05}
}


Last modification: 21.9.2017. Please email your comments to Tamás Király!