Rigid realizations of graphs on small grids

Zsolt Fekete, T. Jordán

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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 language English 216-222 7 Computational Geometry: Theory and Applications 32 3 https://doi.org/10.1016/j.comgeo.2005.04.001 Published - Nov 2005

Fingerprint

Grid
Graph in graph theory
Straight Line
Distinct
Framework

• Graph
• Realization
• Rigidity

ASJC Scopus subject areas

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

Cite this

Rigid realizations of graphs on small grids. / Fekete, Zsolt; Jordán, T.

In: Computational Geometry: Theory and Applications, Vol. 32, No. 3, 11.2005, p. 216-222.

Research output: Contribution to journalArticle

@article{9ace4a12c00f4be9a7649fb1cdc63c4b,
title = "Rigid realizations of graphs on small grids",
abstract = "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.",
keywords = "Graph, Realization, Rigidity",
author = "Zsolt Fekete and T. Jord{\'a}n",
year = "2005",
month = "11",
doi = "10.1016/j.comgeo.2005.04.001",
language = "English",
volume = "32",
pages = "216--222",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Rigid realizations of graphs on small grids

AU - Fekete, Zsolt

AU - Jordán, T.

PY - 2005/11

Y1 - 2005/11

N2 - 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.

AB - 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.

KW - Graph

KW - Realization

KW - Rigidity

UR - http://www.scopus.com/inward/record.url?scp=84867951749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867951749&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2005.04.001

DO - 10.1016/j.comgeo.2005.04.001

M3 - Article

VL - 32

SP - 216

EP - 222

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 3

ER -