math_groups_discgeom

Generic rigidity with forced symmetry and sparse colored graphs

Justin Malestein, Louis Theran— 2012

Focus Area 1: High-complexity Geometry We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only collapsed realizations. In terms of infinitesimal rigidity, realizations of the former produce a framework and the latter certifies that this framework is infinitesimally rigid.

TitleGeneric rigidity with forced symmetry and sparse colored graphs
AuthorJustin Malestein, Louis Theran
Date201203
Source(s)
TypeText
Size or Duration14 pages