1-EXTENSIONS AND GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS

DOI10.1142/S0218195912500173zbMath1267.05269OpenAlexW2065652052MaRDI QIDQ5300012

Viet Hang Nguyen

Publication date: 24 June 2013

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195912500173

zbMATH Keywords

global rigiditydirection-length frameworks

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Equivalent realisations of a rigid graph

Cites Work

• Bounded direction-length frameworks
• Necessary conditions for the global rigidity of direction-length frameworks
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Connected rigidity matroids and unique realizations of graphs
• Globally linked pairs of vertices in equivalent realizations of graphs
• OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS
• Characterizing generic global rigidity
• Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths

This page was built for publication: 1-EXTENSIONS AND GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS