Dynamic Multilevel Graph Visualization
Todd L. Veldhuizen · arXiv (Cornell University) · 2007
We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as point particles. We simulate fine and coarse levels of the graph simultaneously, coupling the dynamics of adjacent levels. Projection from coarser to finer levels is adaptive, with the projection determined by an affine transformation that evolves alongside the graph layouts. The result is a dynamic graph visualizer that quickly and smoothly adapts to changes in a graph.
Cited by 10 works. doi:10.48550/arxiv.0712.1549 Open-access PDF
Authors
References
- Graph drawing by force‐directed placement
- An algorithm for drawing general undirected graphs
- A Heuristic for Graph Drawing
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Graph visualization and navigation in information visualization: A survey
- Graphviz and Dynagraph — Static and Dynamic Graph Drawing Tools
- A fast adaptive layout algorithm for undirected graphs
- A Fast Multi-Scale Method for Drawing Large Graphs
- ACE: a fast multiscale eigenvectors computation for drawing huge graphs
- A Multilevel Algorithm for Force-Directed Graph-Drawing