Abstract

A tensegrity graph is a graph with edges labeled as bars, cables and struts. A realization of a tensegrity graph T is a pair (T,p), where p maps the vertices of T into Rd for some d≥1. The realization is globally rigid if any realization (T,q) in Rd in which the bars have the same length and the cables and struts are not longer and not shorter, respectively, is an isometric image of (T,p). A tensegrity graph is weakly globally rigid in Rd if it has a generic globally rigid realization in Rd, and strongly globally rigid in Rd if every generic realization in Rd is globally rigid.In this paper we give a necessary condition for weak global rigidity in Rd and prove that in the d=1 case the same condition is also sufficient. In particular, our results imply that a tensegrity graph has a generic globally rigid realization in R1 if and only if it has a generic universally rigid realization in R1. We also show that recognizing strongly globally rigid tensegrity graphs in Rd is co-NP-hard for all d≥1.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call