Abstract
Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the reflection acts freely on the vertex set. At the framework level, these characterisations are given in terms of induced monochrome subgraph decompositions, and at the graph level they are given in terms of sparsity counts and recursive construction sequences for the corresponding signed quotient graphs.
Highlights
Recent work in geometric rigidity has seen an analysis of frameworks in which the standard Euclidean norm is replaced by a non-Euclidean norm
We consider two-dimensional frameworks and norms for which the unit ball is a quadrilateral. Such frameworks are grid-like in the sense that the allowable motions constrain vertices adjacent to any pinned vertex to move along the boundary of a quadrilateral which is centred at the pinned vertex and obtained from the unit ball by translation and dilation
The problem of maintaining rigid formations of autonomous agents is a well-known application of geometric rigidity theory and its associated “pebble game” algorithms
Summary
Recent work in geometric rigidity has seen an analysis of frameworks in which the standard Euclidean norm is replaced by a non-Euclidean norm (see [6, 7, 8, 9]). The third aim, which is in the spirit of Laman’s theorem (see [10, 20, 22]), is to provide complete characterisations for graphs which admit placements as rigid grid-like frameworks with reflectional symmetry These characterisations provide the sufficiency direction for the necessary counting conditions derived in the general theory of Section 2. We note that these matroidal counts can be checked in polynomial time using a straightforward adaptation of the algorithm described in [4, Sect. 10] (see [1])
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
