Combinatorial characterization of the Assur graphs from engineering

DOI10.1016/J.EJC.2009.11.019zbMATH Open1191.05077arXiv0801.2525OpenAlexW1973866695MaRDI QIDQ973098FDOQ973098

Offer Shai, Brigitte Servatius, Walter Whiteley

Publication date: 28 May 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology, questions, methods and conjectures from the kinematics terminology for one degree of freedom linkages to the terminology of Assur graphs as graphs with special properties in rigidity theory. Exploiting recent works in combinatorial rigidity theory we provide mathematical characterizations of these graphs derived from minimal linkages. With these characterizations, we confirm a series of conjectures posed by Offer Shai, and offer techniques and algorithms to be exploited further in future work.

Full work available at URL: https://arxiv.org/abs/0801.2525

Recommendations

• Geometric properties of Assur graphs
• Directed graphs, decompositions, and spatial linkages
• Symmetry adapted assur decompositions
• Generating all rigidity circuits on at most 10 vertices and all Assur graphs on at most 11 vertices
• Assur decompositions of direction-length frameworks

zbMATH Keywords

kinematicsAssur graphsrigid theory

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Dynamics of multibody systems (70E55)

Cites Work

• An algorithm for two-dimensional rigidity percolation: The pebble game
• On graphs and rigidity of plane skeletal structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• The rigidity of certain cabled frameworks and the second-order rigidity of arbitrary triangulated convex surfaces
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Title not available (Why is that?)
• Structural synthesis of planar kinematic chains by adapting a McKay-type algorithm
• Geometric properties of Assur graphs
• Title not available (Why is that?)
• Spaces of stresses, projections and parallel drawings for spherical polyhedra
• The Algebraic Geometry of Stresses in Frameworks
• Position analysis in polynomial form of planar mechanisms with Assur groups of class 3 including revolute and prismatic joints.
• Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations.

Cited In (9)

• An Improved Bound for the Rigidity of Linearly Constrained Frameworks
• Symmetric versions of Laman's theorem
• Graph-based structural analysis of planar mechanisms
• Integrable systems in planar robotics
• Geometric properties of Assur graphs
• Title not available (Why is that?)
• Assur decompositions of direction-length frameworks
• Directed graphs, decompositions, and spatial linkages
• Point-hyperplane frameworks, slider joints, and rigidity preserving transformations

This page was built for publication: Combinatorial characterization of the Assur graphs from engineering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973098)