On the combinatorics of infinitesimally rigid frameworks

Authors
  • G. Laman
Publication date 2000
Publisher s.n.
Organisations
  • Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
Abstract Starting from a short survey of minimal infinitesimally rigid frameworks it is shown by an example that and why a two-dimensional characterization of them cannot be extended to higher dimensions just like that. The findings of a closer inspection of the interdependence of the rows of the relevant matrices are translated into the language of graph theory. A characterization of the said frameworks in graph theoretical terms follows. It is no longer restricted in dimension.
Document type Working paper
Permalink to this page
Back