Drawing Clustered Graphs on an Orthogonal Grid (1999)
Cached
Download Links
- [www.emis.ams.org]
- [algo.kuamp.kyoto-u.ac.jp]
- [www.emis.de]
- [www.cs.brown.edu]
- [www.emis.math.ca]
- [www.cs.brown.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 14 - 1 self |
BibTeX
@MISC{Eades99drawingclustered,
author = {Peter Eades and Qingwen Feng and Hiroshi Nagamochi},
title = {Drawing Clustered Graphs on an Orthogonal Grid},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which produces planar drawings of clustered graphs in a convention known as orthogonal grid rectangular cluster drawings. If the input graph has n vertices, then the algorithm produces in O(n) time a drawing with O(n²) area and at most 3 bends in each edge. This result is as good as existing results for classical planar graphs. Further, we show that our algorithm is optimal in terms of the number of bends per edge.
Citations
No citations identified.
