Symmetric Isostatic Frameworks with $\ell^1$ or $\ell^\infty$ Distance Constraints

Electronic Journal Of Combinatorics

Derek Kitson¹ 

关键词: Tree packings;    Spanning trees;    Bar-joint framework;    Infinitesimal rigidity;    Symmetric framework;    Minkowski geometry;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others