Planar Polyline Drawings with Good Angular Resolution (1998)
| Venue: | Graph Drawing (Proc. GD '98), volume 1547 of LNCS |
| Citations: | 20 - 1 self |
BibTeX
@INPROCEEDINGS{Gutwenger98planarpolyline,
author = {Carsten Gutwenger and Petra Mutzel},
title = {Planar Polyline Drawings with Good Angular Resolution},
booktitle = {Graph Drawing (Proc. GD '98), volume 1547 of LNCS},
year = {1998},
pages = {167--182},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n \Gamma 5) \Theta ( 3 2 n \Gamma 7 2 ) grid with at most 5n \Gamma 15 bends and minimum angle ? 2 d . In the constructed drawings, every edge has at most three bends and length O(n). To our best knowledge, this algorithm achieves the best simultaneous bounds concerning the grid size, angular resolution, and number of bends for planar grid drawings of high-degree planar graphs. Besides the nice theoretical features, the practical drawings are aesthetically very pleasing. An implementation of our algorithm is available with the AGD-Library (Algorithms for Graph Drawing) [2, 1]. Our algorithm is based on ideas by Kant for polyline grid drawings for triconnected plane graphs [23]. In particular, our algorithm significantly improves upon his bounds on the angular resolution and the grid size for non-triconnected plane graphs....
