Fast interactive 3-D graph visualization
We present a 3-D version of Gem , a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm . The new version, Gem-3D, contains several improvements besides the adaptation to 3-D geometry.
The main result of this work is that for the first time, 3-D layout and presentation techniques are combined available at interactive speed. Even large real-life graphs with hundreds of vertices can be meaningfully displayed by enhancing the presentation with additional visual clues (color, perspective and light) and the possibility of interactive user navigation.
In the demonstration, we interactively visualize many graphs (artificial and realworld) of different size and complexity to support our claims. We show that Gem-3D is capable of producing a textbook-like drawing of the Petersen graph, a notoriously hard case for automatic drawing tools. To the best of our knowledge, this has not been achieved before by automatic layout algorithms purely based on heuristics.
- 1.Ingo W. Bruß. Konzeption und Realisierung einer Visualisierungskomponente für komplexe Datenstrunkturen unter dem Werkzeug CAKETool. Master's thesis, Universität Karlsruhe, 1995.Google Scholar
- 2.R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. In Proceedings of Graph Drawing'94, volume 894 of LNCS, pages 1–11. Springer, 1994.Google Scholar
- 3.R. Davidson and David Harel. Drawing graphs nicely using simulated annealing. Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989. revised July 1993, to appear in Communications of the ACM.Google Scholar
- 4.P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.Google Scholar
- 5.Kim M. Fairchild, Steven E. Poltrock, and George W. Furnas. SemNet: Three-Dimensional Graphic Representations of Large Knowledge Bases, chapter 5. Lawrence Erlbaum associates, 1988.Google Scholar
- 6.Arne K. Frick, Heiko Mehldau, and Andreas Ludwig. A fast adaptive layout algorithm for undirected graphs. In Proceedings of Graph Drawing'94, volume 894 of LNCS, pages 388–403. Springer, 1994.Google Scholar
- 7.T.M.J. Fruchterman and E.M. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21, 1991.Google Scholar
- 8.J.G. Hollands, T.T. Carey, M.L. Matthews, and C.A. McCann. Presenting a graphical network: A comparison of performance using fisheye and scrolling views. In Proceedings of the 3rd International Conference on Human-Computer Interaction, pages 313–320, September 1989.Google Scholar
- 9.T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31, 1989.Google Scholar
- 10.Donald E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York, 1993.Google Scholar
- 11.J.D. Mackinlay, George G. Robertson, and S.K. Card. The perspective wall: Detail and context smoothly integrated. In Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, pages 173–179. ACM, 1991.Google Scholar
- 12.Cathleen McGrath, Jim Blythe, and David Krackhardt. The effect of graph layout on inference from social network data. In Proceedings of GD'95, 1995.Google Scholar
- 13.Burkhard Monien, Friedhelm Ramme, and Helmut Salmen. A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs. In Proceedings of GD'95, 1995.Google Scholar
- 14.Helen C. Purchase, Robert F. Cohen, and Murray I. James. Validating graph drawing æsthetics. In Proceedings of GD'95, 1995.Google Scholar
- 15.S.P. Reiss. 3-D Visualization of Program Information. In R. Tamassia and I. Tollis, editors, Graph Drawing DIMACS International Workshop GD '94, number 894 in LNCS, pages 12–24. Springer Verlag, 1994.Google Scholar
- 16.George G. Robertson, J.D. Mackinlay, and S.K. Card. Cone trees: Animated 3-D visualizations of hierarchical information. In Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems. ACM, 1991.Google Scholar