Assur decompositions of direction-length frameworks
From MaRDI portal
Publication:2056896
DOI10.1007/978-3-030-63072-0_11zbMath1479.05232OpenAlexW3017031909MaRDI QIDQ2056896
Publication date: 8 December 2021
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/142822/1/NixonAssurDirectionLength.pdf
bar-joint frameworkrigid graphAssur decompositionAssur graphdirection-length frameworkpinned framework
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Bounded direction-length frameworks
- Combinatorial characterization of the Assur graphs from engineering
- Geometric properties of Assur graphs
- An algorithm for two-dimensional rigidity percolation: The pebble game
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Graph-based structural analysis of planar mechanisms
- Inductive constructions for frameworks on a two-dimensional fixed torus
- Symmetry adapted assur decompositions
- Directed graphs, decompositions, and spatial linkages
- Pebble game algorithms and sparse graphs
- On the degrees of the vertices of a directed graph
- Edge-Disjoint Spanning Trees of Finite Graphs
- Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
- Bearing-Based Formation Control of A Group of Agents with Leader-First Follower Structure
- Rigidity of Frameworks Supported on Surfaces
- Bearing Rigidity Theory and Its Applications for Control and Estimation of Network Systems: Life Beyond Distance Rigidity
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- Depth-First Search and Linear Graph Algorithms
