Symmetric Isostatic Frameworks with $\ell^1$ or $\ell^\infty$ Distance Constraints
Keywords:
Tree packings, Spanning trees, Bar-joint framework, Infinitesimal rigidity, Symmetric framework, Minkowski geometry
Abstract
Combinatorial characterisations of minimal rigidity are obtained for symmetric $2$-dimensional bar-joint frameworks with either $\ell^1$ or $\ell^\infty$ distance constraints. The characterisations are expressed in terms of symmetric tree packings and the number of edges fixed by the symmetry operations. The proof uses new Henneberg-type inductive construction schemes.
Published
2016-11-10
How to Cite
Kitson, D., & Schulze, B. (2016). Symmetric Isostatic Frameworks with $\ell^1$ or $\ell^\infty$ Distance Constraints. The Electronic Journal of Combinatorics, 23(4), P4.23. https://doi.org/10.37236/6044
Article Number
P4.23