A form-finding problem for tensegrity structures is studied; given an abstract graph, we show an algorithm to provide a necessary condition for it to be the underlying graph of a tensegrity in Rd (typically d=2,3) with vertices in general position. Furthermore, for a certain class of graphs our algorithm allows to obtain necessary and sufficient conditions on the relative position of the vertices in order to underlie a tensegrity, for what we propose both a geometric and a symbolic approach.
@article{urn:eudml:doc:41588,
title = {From graphs to tensegrity structures: geometric and symbolic approaches.},
journal = {Publicacions Matem\`atiques},
volume = {50},
year = {2006},
pages = {279-299},
zbl = {1113.05094},
mrnumber = {MR2273662},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:41588}
}
Guzmán, Miguel de; Orden, David. From graphs to tensegrity structures: geometric and symbolic approaches.. Publicacions Matemàtiques, Tome 50 (2006) pp. 279-299. http://gdmltest.u-ga.fr/item/urn:eudml:doc:41588/