A Technique for Drawing Directed Graphs (1993)
Cached
Download Links
| Venue: | IEEE Transactions on Software Engineering |
| Citations: | 221 - 19 self |
BibTeX
@ARTICLE{Gansner93atechnique,
author = {Emden R. Gansner and Eleftherios Koutsofios and Stephen C. North and Kiem-phong Vo},
title = {A Technique for Drawing Directed Graphs},
journal = {IEEE Transactions on Software Engineering},
year = {1993},
pages = {214--230}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliary graph. The fourth pass makes splines to draw edges. The algorithm makes good drawings and runs fast. 1.
