Operations preserving the global rigidity of graphs and frameworks in the plane

Tibor Jordán, Zoltán Szabadka

Research output: Contribution to journalArticle

15 Citations (Scopus)


A straight-line realization of (or a bar-and-joint framework on) graph G in Rd is said to be globally rigid if it is congruent to every other realization of G with the same edge lengths. A graph G is called globally rigid in Rd if every generic realization of G is globally rigid. We give an algorithm for constructing a globally rigid realization of globally rigid graphs in R2. If G is triangle-reducible, which is a subfamily of globally rigid graphs that includes Cauchy graphs as well as Grünbaum graphs, the constructed realization will also be infinitesimally rigid. Our algorithm relies on the inductive construction of globally rigid graphs which uses edge additions and one of the Henneberg operations. We also show that vertex splitting, which is another well-known operation in combinatorial rigidity, preserves global rigidity in R2.

Original languageEnglish
Pages (from-to)511-521
Number of pages11
JournalComputational Geometry: Theory and Applications
Issue number6-7
Publication statusPublished - Aug 1 2009


  • Gale transform
  • Globally rigid framework
  • Rigid graph
  • Vertex split

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Operations preserving the global rigidity of graphs and frameworks in the plane'. Together they form a unique fingerprint.

  • Cite this