Constructing isostatic frameworks for the ell^infty plane
classification
🧮 math.MG
keywords
rigidityinftyisostaticplaneadaptbar-jointcolouredconstraints
read the original abstract
We use a new coloured multi-graph constructive method to prove that every 2-tree decomposition can be realised in the plane as a bar-joint framework which is minimally rigid (isostatic) with respect to $\ell^1$ or $\ell^\infty$ distance constraints. We show how to adapt this technique to incorporate symmetry and indicate several related open problems on rigidity, redundant rigidity and forced symmetric rigidity in normed spaces.
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.