Globally rigid circuits of the direction-length rigidity matroid

DOI10.1016/j.jctb.2009.03.004zbMath1219.05034MaRDI QIDQ968450

Tibor Jordán, Bill Jackson

Publication date: 5 May 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.03.004

zbMATH Keywords

rigidity matroid; direction and length constraints; globally rigid graphs

Mathematics Subject Classification ID

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Polygons with Prescribed Angles in 2D and 3D, Polygons with Prescribed Angles in 2D and 3D, One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory, Boundedness, rigidity and global rigidity of direction-length frameworks, Bounded direction-length frameworks, Necessary conditions for the global rigidity of direction-length frameworks, Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids, Global rigidity of direction-length frameworks, OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS, Matroids of gain graphs in applied discrete geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• Globally linked pairs of vertices in equivalent realizations of graphs
• On graphs and rigidity of plane skeletal structures
• Characterizing generic global rigidity
• On Generic Rigidity in the Plane
• Conditions for Unique Graph Realizations
• Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Dividing a Graph into Triconnected Components
• The Molecule Problem: Exploiting Structure in Global Optimization
• Algorithms - ESA 2003