Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Drawing graphs: methods and models
Drawing graphs: methods and models
Visualization of bibliographic networks with a reshaped landscape metaphor
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Combining Hierarchy and Energy Drawing Directed Graphs
IEEE Transactions on Visualization and Computer Graphics
On the optimality of spectral compression of mesh data
ACM Transactions on Graphics (TOG)
ACM SIGMOBILE Mobile Computing and Communications Review
Interacting urns processes: for clustering of large-scale networks of tiny artifacts
Proceedings of the 2008 ACM symposium on Applied computing
Searching the wikipedia with contextual information
Proceedings of the 17th ACM conference on Information and knowledge management
Mesh parameterization: theory and practice
ACM SIGGRAPH ASIA 2008 courses
Enhanced graph-based dimensionality reduction with repulsion Laplaceans
Pattern Recognition
Drawing graphs by eigenvectors: theory and practice
Computers & Mathematics with Applications
ACM SIGGRAPH ASIA 2009 Courses
A spectral characterization of the Delaunay triangulation
Computer Aided Geometric Design
SSDE: fast graph drawing using sampled spectral distance embedding
GD'06 Proceedings of the 14th international conference on Graph drawing
Enhanced spectral embedding with semi-supervised feature selection
ICNC'09 Proceedings of the 5th international conference on Natural computation
Graph visualization with latent variable models
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Query similarity by projecting the query-flow graph
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
ACM SIGGRAPH 2010 Courses
Visualization of labeled data using linear transformations
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Social Network Analysis and Mining for Business Applications
ACM Transactions on Intelligent Systems and Technology (TIST)
Elements of geometry processing
SIGGRAPH Asia 2011 Courses
Dimensionality reduction for semi-supervised face recognition
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Distributed graph layout for sensor networks
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing directed graphs clockwise
GD'09 Proceedings of the 17th international conference on Graph Drawing
Encounter based sensor tracking
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Asynchronous distributed power iteration with gossip-based normalization
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Using graph layout to generalise focus+context image magnification and distortion
Proceedings of the 27th Conference on Image and Vision Computing New Zealand
Surface- and volume-based techniques for shape modeling and analysis
SIGGRAPH Asia 2013 Courses
| Hi-index | 0.00 |
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.