An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Proceedings of the conference on Visualization '01
Hierarchical Clustering of Trees: Algorithms and Experiments
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Advances in information visualisation: recent outcomes
The Knowledge Engineering Review
Network Visualization by Semantic Substrates
IEEE Transactions on Visualization and Computer Graphics
Human-centered visualization environments
Human-centered visualization environments
| Hi-index | 0.00 |
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs of substantially larger size than any other algorithm we are awars of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in less than 3 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which can significantly improve the speed of essentially any force-directed method.Graphs have become an important part of recently proposed user interfaces, hence the relevance of this paper to work on interface issues.