MGV: A System for Visualizing Massive Multidigraphs
IEEE Transactions on Visualization and Computer Graphics
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GRIP: Graph dRawing with Intelligent Placement
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Effective Graph Visualization Via Node Grouping
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
Proceedings of the Working Conference on Advanced Visual Interfaces
| 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 aware of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in less than 5 seconds. The paper contains several graphs with over 3000 nodes. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the recently published multi-scale algorithm of Hadany and Harel. It can significantly improve the speed of essentially any force-directed method (regardless of that method''s ability of drawing weighted graphs or the continuity of its cost-function). In passing, we also discuss simple modifications of the known Kamada and Kawai force-directed method, which greatly improve its ability to deal with large graphs.