Abstract
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.
Keywords
Computer scienceGraphVisualizationGraph LayoutAffine transformationGraph drawingGraph rewritingTheoretical computer scienceAlgorithmMathematicsArtificial intelligenceGeometry
Related Publications
Semantic Image Synthesis With Spatially-Adaptive Normalization
We propose spatially-adaptive normalization, a simple but effective layer for synthesizing photorealistic images given an input semantic layout. Previous methods directly feed t...
Publication Info
- Year
- 2007
- Type
- preprint
- Citations
- 10
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
10
OpenAlex
Cite This
Todd L. Veldhuizen
(2007).
Dynamic Multilevel Graph Visualization.
arXiv (Cornell University)
.
https://doi.org/10.48550/arxiv.0712.1549
Identifiers
- DOI
- 10.48550/arxiv.0712.1549