An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

Authors:
Aurora Morgana;Célia Picinin de Mello;Giovanna Sontacchi
Affiliations:
Dipartimento di Matematica, Università di Roma I, P.le Aldo Moro, 2 -000185 Rome, Italy;Instituto de Computação, Unirersidade Estadual de Campinas, Caixa Postal 6176, 3081-970 Campinas, SP, Brazil;Dipartimento di Matematica, Università di Roma I, P.le Aldo Moro, 2 -000185 Rome, Italy
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 1
Cited 1

A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid

Discrete Applied Mathematics

Orthogonal graph drawing with flexibility constraints

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we characterize the class of plane graphs that can be embedded on the two-dimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden configuration or generates an embedding with at most one bend on each edge.