On Spectral Graph Drawing
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties. We present a novel view of the spectral approach, which provides a direct link between eigenvectors and the aesthetic properties of the layout. In addition, we present a new formulation of the spectral drawing method with some aesthetic advantages. This formulation is accompanied by an aesthetically-motivated algorithm, which is much easier to understand and to implement than the standard numerical algorithms for computing eigenvectors.
Unable to display preview. Download preview PDF.
- 1.U. Brandes and T. Willhalm, “Visualizing Bibliographic Networks with a Reshaped Landscape Metaphor”, Proc. 4th Joint Eurographics — IEEE TCVG Symp. Visualization (VisSym’ 02), pp. 159–164, ACM Press, 2002.Google Scholar
- 2.L. Carmel, Y. Koren and D. Harel, “Visualizing and Classifying Odors Using a Similarity Matrix”, Proceedings of the ninth International Symposium on Olfaction and Electronic Nose (ISOEN’02), IEEE, to appear, 2003.Google Scholar
- 3.F.R.K. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, American Mathematical Society, 1997.Google Scholar
- 4.G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.Google Scholar
- 5.G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996.Google Scholar
- 9.Y. Koren, L. Carmel and D. Harel, “ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs”, Proceedings of IEEE Information Visualization 2002 (InfoVis’02), IEEE, pp. 137–144, 2002.Google Scholar
- 15.A. Webb, Statistical Pattern Recognition, Arnold, 1999.Google Scholar