A new approximation algorithm for bend minimization in the Kandinsky model

Authors:
Wilhelm Barth;Petra Mutzel;Canan Yildiz
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Wien, Austria;Department of Computer Science, University of Dortmund, Dortmund, Germany;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Wien, Austria
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 7
Cited 1

A Layout algorithm for data flow diagrams

IEEE Transactions on Software Engineering
On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
An experimental comparison of three graph drawing algorithms (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Computing Orthogonal Drawings with the Minimum Number of Bends

IEEE Transactions on Computers
Drawing High Degree Graphs with Low Bend Numbers

GD '95 Proceedings of the Symposium on Graph Drawing
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing

GD '96 Proceedings of the Symposium on Graph Drawing
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings

GD '97 Proceedings of the 5th International Symposium on Graph Drawing

Graph drawing algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Kandinsky model has been introduced by Fößmeier and Kaufmann in order to deal with planar orthogonal drawings of planar graphs with maximal vertex degree higher than four [7]. No polynomial-time algorithm is known for computing a (region preserving) bend minimal Kandinsky drawing. In this paper we suggest a new 2-approximation algorithm for this problem. Our extensive computational experiments [13] show that the quality of the computed solutions is better than those of its predecessors [6]. E.g., for all instances in the Rome graph benchmark library [4] it computed the optimal solution, and for randomly generated triangulated graphs with up to 800 vertices, the absolute error was less than 2 on average.