Graph Drawing by High-Dimensional Embedding

  • David Harel
  • Yehuda Koren
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

Abstract

We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 105 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.

References

  1. 1.
    I. Bruss and A. Frick, “Fast Interactive 3-D Graph Visualization”, Proceedings of Graph Drawing 95, LNCS 1027, pp. 99–110, Springer Verlag, 1996.Google Scholar
  2. 2.
    T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990.Google Scholar
  3. 3.
    G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing:Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.Google Scholar
  4. 4.
    B. S. Everitt and G. Dunn, Applied Multivariate Data Analysis, Arnold, 1991.Google Scholar
  5. 5.
    P. Gajer, M. T. Goodrich, and S. G. Kobourov, “A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs”, Proceedings of Graph Drawing 2000, LNCS 1984, pp. 211–221, Springer Verlag, 2000.Google Scholar
  6. 6.
    R. Hadany and D. Harel, “A Multi-Scale Method for Drawing Graphs Nicely”, Discrete Applied Mathematics, 113 (2001), 3–21.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    D. Harel and Y. Koren, “A Fast Multi-Scale Method for Drawing Large Graphs”, Proceedings of Graph Drawing’00, LNCS 1984, Springer Verlag, pp. 183–196, 2000.Google Scholar
  8. 8.
    D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.Google Scholar
  9. 9.
    M. Kaufmann and D. Wagner (Eds.), Drawing Graphs:Methods and Models, LNCS 2025, Springer Verlag, 2001.MATHGoogle Scholar
  10. 10.
    Y. Koren, L. Carmel and D. Harel “ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs”, to appear in Proceedings of IEEE Symposium on Information Visualization (InfoVis) 2002.Google Scholar
  11. 11.
    Y. Koren, “On Spectral Graph Drawing”, manuscript, 2002.Google Scholar
  12. 12.
    A. Quigley and P. Eades, “FADE: Graph Drawing, Clustering, and Visual Abstraction”, Proceedings of Graph Drawing 2000, LNCS 1984, pp. 183–196, Springer Verlag, 2000.Google Scholar
  13. 13.
    D. Tunkelang, A Numerical Optimization Approach to General Graph Drawing, Ph.D. Thesis, Carnegie Mellon University, 1999.Google Scholar
  14. 14.
    C. Walshaw, “A Multilevel Algorithm for Force-Directed Graph Drawing”, Proceedings of Graph Drawing 2000, LNCS 1984, pp. 171–182, Springer Verlag, 2000.Google Scholar
  15. 15.
    D. S. Watkins, Fundamentals of Matrix Computations, John Wiley, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • David Harel
    • 1
  • Yehuda Koren
    • 1
  1. 1.Dept. of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations