Combinatorial characterization of the Assur graphs from engineering

DOI10.1016/j.ejc.2009.11.019zbMath1191.05077arXiv0801.2525MaRDI QIDQ973098

Offer Shai, Brigitte Servatius, Walter J. Whiteley

Publication date: 28 May 2010

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

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

zbMATH Keywords

kinematics; Assur graphs; rigid theory

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C75: Structural characterization of families of graphs

70E55: Dynamics of multibody systems

Related Items

Symmetric versions of Laman's theorem, Geometric properties of Assur graphs, Point-hyperplane frameworks, slider joints, and rigidity preserving transformations, Graph-based structural analysis of planar mechanisms, Directed graphs, decompositions, and spatial linkages

Cites Work

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