2007/12/10 by Todd L. Veldhuizen, Veldhuizen, Todd L.
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Data Visualization and Analytics #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.2 #Graphics (cs.GR) #H.5.0 #Topological and Geometric Data Analysis #cs.DM #cs.GR
paper · pdf · doi:10.48550/arxiv.0712.1549
21 pages
arxiv created 2007/12/10 · openalex publication_date 2007/12/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.