pith. sign in

arxiv: 1203.2276 · v1 · pith:3T5XLOTOnew · submitted 2012-03-10 · 🧮 math.GT

Generic rigidity of reflection frameworks

classification 🧮 math.GT
keywords realizationsframeworkframeworksgenericreflectionrigidrigidityadmits
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.