Dynamic Multilevel Graph Visualization

by: Todd L Veldhuizen

(10 Dec 2007)

View FullText article

arXiv (abstract), arXiv (PDF)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

bigbossman

Find related articles with these CiteULike tags

graph, visualization

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.

@misc{citeulike:2097377, 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.}, author = {Veldhuizen, Todd L. }, citeulike-article-id = {2097377}, eprint = {0712.1549}, keywords = {graph, visualization}, month = {Dec}, posted-at = {2007-12-12 08:24:04}, priority = {0}, title = {Dynamic Multilevel Graph Visualization}, url = {http://arxiv.org/abs/0712.1549}, year = {2007} }

RIS record

TY - ELEC ID - citeulike:2097377 L3 - citeulike-article-id:2097377 TI - Dynamic Multilevel Graph Visualization N2 - 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. KW - graph KW - visualization AU - Veldhuizen, Todd PY - 2007/Dec/10/ UR - http://arxiv.org/abs/0712.1549 ER -

RIS BibTeX