Orthogonal graph drawing with flexibility constraints

Authors:
Thomas Bläsius;Marcus Krug;Ignaz Rutter;Dorothea Wagner
Affiliations:
Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany;Faculty of Informatics, Karlsruhe Institute of Technology, Germany
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 8
Cited 0

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
On-Line Planarity Testing

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

Discrete Applied Mathematics
Spirality and Optimal Orthogonal Drawings

SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
A Linear Time Implementation of SPQR-Trees

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Better Heuristic for Orthogonal Graph Drawings

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we consider the following problem. Given a planar graph G with maximum degree 4 and a function flex : E → N0 that gives each edge a flexibility. Does G admit a planar embedding on the grid such that each edge e has at most flex(e) bends? Note that in our setting the combinatorial embedding of G is not fixed. We give a polynomial-time algorithm for this problem when the flexibility of each edge is positive. This includes as a special case the problem of deciding whether G admits a drawing with at most one bend per edge.