Geometric properties of Assur graphs
From MaRDI portal
Abstract: In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this paper we further explore the geometric properties of Assur graphs, with a focus on singular realizations which have static self-stresses. We provide a new geometric characterization of Assur graphs, based on special singular realizations. These singular positions are then related to dead-end positions in which an associated mechanism with an inserted driver will stop or jam.
Recommendations
- Combinatorial characterization of the Assur graphs from engineering
- Directed graphs, decompositions, and spatial linkages
- Assur decompositions of direction-length frameworks
- Symmetry adapted assur decompositions
- Generating all rigidity circuits on at most 10 vertices and all Assur graphs on at most 11 vertices
Cites work
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 1182943 (Why is no real title available?)
- scientific article; zbMATH DE number 482343 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- Combinatorial characterization of the Assur graphs from engineering
- Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
- Construction of Self-Dual Graphs
- Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations.
- On graphs and rigidity of plane skeletal structures
- Relative centers of motion, implicit bars and dead-center positions for planar mechanisms
- Spaces of stresses, projections and parallel drawings for spherical polyhedra
- The Algebraic Geometry of Motions of Bar-and-Body Frameworks
- The Rigidity of Graphs
Cited in
(7)- Assur decompositions of direction-length frameworks
- Symmetry adapted assur decompositions
- Combinatorial characterization of the Assur graphs from engineering
- Isostatic bar and joint frameworks in the plane with irreducible pure conditions
- Symmetric versions of Laman's theorem
- Directed graphs, decompositions, and spatial linkages
- Generating all rigidity circuits on at most 10 vertices and all Assur graphs on at most 11 vertices
This page was built for publication: Geometric properties of Assur graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973099)