Symmetric isostatic frameworks with l^1 or l^\infty distance constraints

Kitson, Derek and Schulze, Bernd (2016) Symmetric isostatic frameworks with l^1 or l^\infty distance constraints. The Electronic Journal of Combinatorics, 23 (4): #P4.23. ISSN 1077-8926

Full text not available from this repository.

Abstract

Combinatorial characterisations of minimal rigidity are obtained for symmetric 2-dimensional bar-joint frameworks with either l^1 or l^\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.

Item Type:
Journal Article
Journal or Publication Title:
The Electronic Journal of Combinatorics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1703
Subjects:
?? tree packingsspanning treesbar-joint frameworkinfinitesimal rigiditysymmetric frameworkminkowski geometrycomputational theory and mathematicsgeometry and topologytheoretical computer science ??
ID Code:
82783
Deposited By:
Deposited On:
11 Nov 2016 10:00
Refereed?:
Yes
Published?:
Published
Last Modified:
15 Jul 2024 14:47