A comparison of vertex-splitting and spider-splitting for the study of three-dimensional rigidity

Show simple item record

dc.creator d'Eon, Jason N.
dc.date.accessioned 2018-06-13T14:19:18Z
dc.date.available 2018-06-13T14:19:18Z
dc.date.issued 2018-03-29
dc.identifier.uri http://library2.smu.ca/handle/01/27553
dc.description.abstract In two dimensions, generic rigidity is a combinatorial property of a framework, but extensions into three dimensions fail to completely characterize generic rigidity. It is therefore interesting to investigate two graph operations introduced by Walter Whiteley, vertex-splitting and spider-splitting, which are known to take a minimally rigid framework in three dimensions to a new minimally rigid framework with an additional vertex. We present algorithms for generating all possible graphs obtained by vertex-splitting, spider-splitting, and combinations of vertex-splitting and spidersplitting. For graphs with up to and including 8 vertices, the set of graphs obtained by spider-splitting is a subset of the set obtained by vertex-splitting. Additionally, the set produced by combinations of vertex-splitting and spider-splitting is equal to the set obtained by vertex-splitting. This suggests that as a method for generating rigid graphs, spider-splitting is inferior to vertex-splitting at all steps of iteration. en_CA
dc.language.iso en en_CA
dc.title A comparison of vertex-splitting and spider-splitting for the study of three-dimensional rigidity en_CA
dc.type Text en_CA


Files in this item

 
 

This item appears in the following Collection(s)

Show simple item record