GRIP: Graph dRawing with Intelligent Placement
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The system allows for drawing graphs with tens of thousands of vertices in under a minute on a mid-range PC. To the best of the authors’ knowledge GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.
- 1.I. Bruß and A. Frick. Fast interactive 3-D graph visualization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95), volume 1027 of Lecture Notes Computer Science, pages 99–110. Springer-Verlag, 1996.Google Scholar
- 2.T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.Google Scholar
- 4.A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD’ 94), LNCS 894, pages 388–403, 1995.Google Scholar
- 6.P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. In To appear in Proceedings of the 8th Symposium on Graph Drawing, 2000.Google Scholar
- 7.D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Technical Report MCS99–21, The Weizmann Institute of Science, Rehovot, Israel, 1999.Google Scholar
- 8.T. Kamada and S. Kawai. Automatic display of network structures for human understanding. Technical Report 88–007, Department of Information Science, University of Tokyo, 1988.Google Scholar