Envisioning information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
GD '95 Proceedings of the Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Interactive Visualization of Small World Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
Visual Exploration of Complex Time-Varying Graphs
IEEE Transactions on Visualization and Computer Graphics
ASK-GraphView: A Large Scale Graph Visualization System
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
IEEE Transactions on Visualization and Computer Graphics
The "mental map" versus "static aesthetic" compromise in dynamic graphs: a user study
AUIC '08 Proceedings of the ninth conference on Australasian user interface - Volume 76
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Rapid Graph Layout Using Space Filling Curves
IEEE Transactions on Visualization and Computer Graphics
Locality and bounding-box quality of two-dimensional space-filling curves
Computational Geometry: Theory and Applications
How important is the "Mental map"?: an empirical investigation of a dynamic graph layout algorithm
GD'06 Proceedings of the 14th international conference on Graph drawing
Visualizing internet evolution on the autonomous systems level
GD'07 Proceedings of the 15th international conference on Graph drawing
Proceedings of the 5th international symposium on Software visualization
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
IEEE Transactions on Visualization and Computer Graphics
Parallel Edge Splatting for Scalable Dynamic Graph Visualization
IEEE Transactions on Visualization and Computer Graphics
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Computer Science Review
Embedding, clustering and coloring for dynamic maps
PACIFICVIS '12 Proceedings of the 2012 IEEE Pacific Visualization Symposium
| Hi-index | 0.00 |
In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.