A Technique for Drawing Directed Graphs (1993) [174 citations — 16 self]
http://www.research.att.com/sw/tools/graphviz/TSE9
http://solo.uwaterloo.ca/~ijdavis/graph/graph_draw
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
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},
volume = {19},
pages = {214--230}
}
Years of Citing Articles
Bookmarks
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. Introduction Drawing abstract graphs is a topic of ongoing research, having such applications as visualization of programs and data structures, and document preparation. This paper describes a technique for drawing directed graphs in the plane. The goal is to make high-quality drawings quickly enough for interactive use. These algorithms are the basis of a practical implementation [GNV1]. 1.1 Aesthetic criteria To make drawings, it helps to assume that a directed graph has an overall...
