From graphs to tensegrity structures: geometric and symbolic approaches.

Guzmán, Miguel de, and Orden, David. "From graphs to tensegrity structures: geometric and symbolic approaches.." Publicacions Matemàtiques 50.2 (2006): 279-299. <http://eudml.org/doc/41588>.

@article{Guzmán2006,
abstract = {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.},
author = {Guzmán, Miguel de, Orden, David},
journal = {Publicacions Matemàtiques},
keywords = {Geometría discreta; Problemas combinatorios; Teoría de grafos; polynomial elimination; algorithm},
language = {eng},
number = {2},
pages = {279-299},
title = {From graphs to tensegrity structures: geometric and symbolic approaches.},
url = {http://eudml.org/doc/41588},
volume = {50},
year = {2006},
}

TY - JOUR
AU - Guzmán, Miguel de
AU - Orden, David
TI - From graphs to tensegrity structures: geometric and symbolic approaches.
JO - Publicacions Matemàtiques
PY - 2006
VL - 50
IS - 2
SP - 279
EP - 299
AB - 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.
LA - eng
KW - Geometría discreta; Problemas combinatorios; Teoría de grafos; polynomial elimination; algorithm
UR - http://eudml.org/doc/41588
ER -