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). 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/2600/2614
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 Sep 2023 00:15