A Better Heuristic for Orthogonal Graph Drawings (1998)
| Venue: | COMPUT. GEOM. THEORY APPL |
| Citations: | 57 - 6 self |
BibTeX
@INPROCEEDINGS{Biedl98abetter,
author = {Therese Biedl and Goos Kant},
title = {A Better Heuristic for Orthogonal Graph Drawings},
booktitle = {COMPUT. GEOM. THEORY APPL},
year = {1998},
pages = {24--35},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any connected graph orthogonally on a grid of size n \Theta n with at most 2n + 2 bends. Each edge is bent at most twice. In particular for non-planar and non-biconnected planar graphs, this is a big improvement. The algorithm is very simple, easy to implement, and it handles both planar and non-planar graphs at the same time.
