Globally rigid circuits of the direction-length rigidity matroid

DOI10.1016/J.JCTB.2009.03.004MaRDI QIDQ968450zbMATH OpenOpenAlexFDO

Authors Bill Jackson, Tibor Jordán

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 matroiddirection and length constraintsglobally rigid graphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Flexible circuits in the d‐dimensional rigidity matroid
• Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
• Rigidity Matroids
• Rigidity, global rigidity, and graph decomposition
• Rigidity theory for matroids
• Oriented matroid rigidity of multiplices
• Connected rigidity matroids and unique realizations of graphs
• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Sufficient conditions for the global rigidity of graphs

Cites work

• scientific article; zbMATH DE number 17636 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Algorithms for graph rigidity and scene analysis
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• Connected rigidity matroids and unique realizations of graphs
• Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
• Dividing a Graph into Triconnected Components
• Generic global rigidity
• Globally linked pairs of vertices in equivalent realizations of graphs
• On Generic Rigidity in the Plane
• On graphs and rigidity of plane skeletal structures
• The Molecule Problem: Exploiting Structure in Global Optimization

Cited in

(11)

• Polygons with Prescribed Angles in 2D and 3D
• Operations preserving global rigidity of generic direction-length frameworks
• Matroids of gain graphs in applied discrete geometry
• 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
• One brick at a time: a survey of inductive constructions in rigidity theory
• Global rigidity of direction-length frameworks
• Double-distance frameworks and mixed sparsity graphs
• Polygons with prescribed angles in 2D and 3D

This page was built for publication: Globally rigid circuits of the direction-length rigidity matroid

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