An Incremental Layout Method for Visualizing Online Dynamic Graphs

Having the ability to draw dynamic graphs is key to better understanding evolving relationships and analyzing the patterns and trends in a network. Traditional force-directed methods are not suitable for laying out dynamic graphs because of their design for static graphs. An alternative is to create an incremental version of the force multilevel multi-pole method (FM3); however, previous solutions are more susceptible to graph degradation, that is, graph illegibility due to long edges or edge crossings. This is typically caused when distant components are connected, resulting in long and overlapping edges. We present our incremental version of FM3 with a refinement scheme, which solves this problem by “refining” the parts of the graph with high energy. Our resulting visualization maintains readability of the graph structure and is efficient in laying out these changing networks. We evaluate the effectiveness of our method by comparing it with two previous online dynamic graph methods.

[1]  Ananth Grama,et al.  Analyzing the Error Bounds of Multipole-Based Treecodes , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[2]  A. Tal,et al.  Dynamic Drawing of Clustered Graphs , 2004, IEEE Symposium on Information Visualization.

[3]  Jean-Daniel Fekete,et al.  GraphDiaries: Animated Transitions andTemporal Navigation for Dynamic Networks , 2014, IEEE Transactions on Visualization and Computer Graphics.

[4]  Ayellet Tal,et al.  Multi-Level Graph Layout on the GPU , 2007, IEEE Transactions on Visualization and Computer Graphics.

[5]  Ulrik Brandes,et al.  Dynamic Spectral Layout with an Application to Small Worlds , 2007, J. Graph Algorithms Appl..

[6]  Michael Burch,et al.  The State of the Art in Visualizing Dynamic Graphs , 2014, EuroVis.

[7]  Michael T. Goodrich,et al.  A multi-dimensional approach to force-directed layouts of large graphs , 2000, Comput. Geom..

[8]  Kwan-Liu Ma,et al.  Clustering, Visualizing, and Navigating for Large Dynamic Graphs , 2012, GD.

[9]  Tamara Munzner,et al.  Visual Exploration of Complex Time-Varying Graphs , 2006 .

[10]  Eve E. Hoggan,et al.  How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm , 2006, GD.

[11]  Helen C. Purchase,et al.  Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs , 2008, Diagrams.

[12]  Ayellet Tal,et al.  Online Dynamic Graph Drawing , 2008, IEEE Transactions on Visualization and Computer Graphics.

[13]  Yifan Hu,et al.  Embedding, clustering and coloring for dynamic maps , 2012, 2012 IEEE Pacific Visualization Symposium.

[14]  Ulrik Brandes,et al.  A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing , 2011, GD.

[15]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[16]  Andrew E. Johnson,et al.  Visualizing the Evolution of Community Structures in Dynamic Social Networks , 2011, Comput. Graph. Forum.

[17]  Michael Burch,et al.  Parallel Edge Splatting for Scalable Dynamic Graph Visualization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[18]  Stephen C. North,et al.  Incremental Layout in DynaDAG , 1995, GD.

[19]  Edward R. Tufte,et al.  Envisioning Information , 1990 .

[20]  Kwan-Liu Ma,et al.  An Incremental Layout Method for Visualizing Online Dynamic Graphs , 2015, Graph Drawing.

[21]  Ulrik Brandes,et al.  Visualizing Internet Evolution on the Autonomous Systems Level , 2007, GD.

[22]  Thomas E. Gorochowski,et al.  Using Aging to Visually Uncover Evolutionary Processes on Networks , 2012, IEEE Transactions on Visualization and Computer Graphics.

[23]  Michael Burch,et al.  Visualizing the Evolution of Compound Digraphs with TimeArcTrees , 2009, Comput. Graph. Forum.

[24]  Daniel W. Archambault,et al.  Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs , 2011, IEEE Transactions on Visualization and Computer Graphics.

[25]  David Harel,et al.  A fast multi-scale method for drawing large graphs , 2000, AVI '00.

[26]  Fabian Beck,et al.  Visualizing the Evolution of Communities in Dynamic Graphs , 2015, Comput. Graph. Forum.

[27]  Michael Garland,et al.  Rapid Multipole Graph Drawing on the GPU , 2009, Graph Drawing.

[28]  Stephan Diehl,et al.  Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs , 2004, GD.

[29]  Mark J. Stock,et al.  Toward efficient GPU-accelerated N-body simulations , 2008 .

[30]  Hsu-Chun Yen,et al.  Mental map preserving graph drawing using simulated annealing , 2011, Inf. Sci..

[31]  Aki Hayashi,et al.  Initial Positioning Method for Online and Real-Time Dynamic Graph Drawing of Time Varying Data , 2013, 2013 17th International Conference on Information Visualisation.

[32]  Xiaoru Yuan,et al.  Laplacian-based dynamic graph visualization , 2015, 2015 IEEE Pacific Visualization Symposium (PacificVis).

[33]  Ulrik Brandes,et al.  A Bayesian Paradigm for Dynamic Graph Layout , 1997, GD.

[34]  Daniel A. McFarland.  Student Resistance: How the Formal and Informal Organization of Classrooms Facilitate Everyday Forms of Student Defiance1 , 2001, American Journal of Sociology.

[35]  Stephan Diehl,et al.  Graphs, They Are Changing , 2002, GD.

[36]  Yifan Hu,et al.  Drawing Large Graphs by Low‐Rank Stress Majorization , 2012, Comput. Graph. Forum.

[37]  David Harel,et al.  Drawing Huge Graphs by Algebraic Multigrid Optimization , 2003, Multiscale Model. Simul..

[38]  Stephen G. Kobourov,et al.  GraphAEL: Graph Animations with Evolving Layouts , 2003, GD.

[39]  Michael Jünger,et al.  Large-Graph Layout Algorithms at Work: An Experimental Study , 2007, J. Graph Algorithms Appl..

[40]  Kwan-Liu Ma,et al.  Rapid Graph Layout Using Space Filling Curves , 2008, IEEE Transactions on Visualization and Computer Graphics.

[41]  Christian S. Collberg,et al.  A system for graph-based visualization of the evolution of software , 2003, SoftVis '03.

[42]  Amy Ashurst Gooch,et al.  The Aesthetics of Graph Visualization , 2007, CAe.

[43]  Gautam Kumar,et al.  Visual Exploration of Complex Time-Varying Graphs , 2006, IEEE Transactions on Visualization and Computer Graphics.

[44]  Ramani Duraiswami,et al.  Fast multipole methods on graphics processors , 2008, J. Comput. Phys..

[45]  Yves Chiricota,et al.  Improved efficiency of spring embedders: taking advantage of GPU programming , 2007 .

[46]  Ulrik Brandes,et al.  Dynamic Spectral Layout of Small Worlds , 2005, GD.

[47]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[48]  Peter Eades,et al.  FADE: Graph Drawing, Clustering, and Visual Abstraction , 2000, GD.

[49]  Michael Jünger,et al.  An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs , 2005, GD.

[50]  David Harel,et al.  Graph Drawing by High-Dimensional Embedding , 2002, J. Graph Algorithms Appl..