Rigid realizations of graphs on small grids

Zsolt Fekete, Tibor Jordán

Research output: Contribution to journalArticle

2 Citations (Scopus)


A framework (G,p) is a straight line realization of a graph G=(V,E) in R 2, given by a map pV→R 2. We prove that if (G,p) is an infinitesimally rigid framework then there is an infinitesimally rigid framework (G,q) for which the points q(v), v∈V(G), are distinct points of the k×k grid, where k=⌈√|V|-1⌉+9. We also show that such a framework on G can be constructed in O(| V|3) time.

Original languageEnglish
Pages (from-to)216-222
Number of pages7
JournalComputational Geometry: Theory and Applications
Issue number3
Publication statusPublished - Nov 1 2005


  • Graph
  • Realization
  • Rigidity

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 'Rigid realizations of graphs on small grids'. Together they form a unique fingerprint.

  • Cite this