Exploration of Networks using overview+detail with Constraint-based cooperative layout

A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.

[1]  Mark D. Apperley,et al.  A review and taxonomy of distortion-oriented presentation techniques , 1994, TCHI.

[2]  Uwe Scholz,et al.  MetaCrop: a detailed database of crop plant metabolism , 2007, Nucleic Acids Res..

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

[4]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[5]  Kim Marriott,et al.  IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs , 2006, IEEE Transactions on Visualization and Computer Graphics.

[6]  Roberto Tamassia,et al.  InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing , 1997, GD.

[7]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

[9]  Colin Ware,et al.  Chapter 10 – Interacting with visualizations , 2004 .

[10]  Tamara Munzner,et al.  Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components , 2006, IEEE Transactions on Visualization and Computer Graphics.

[11]  Benjamin B. Bederson,et al.  Does animation help users build mental maps of spatial information? , 1999, Proceedings 1999 IEEE Symposium on Information Visualization (InfoVis'99).

[12]  Yehuda Koren,et al.  Topological Fisheye Views for Visualizing Large Graphs , 2004 .

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

[14]  Danah Boyd,et al.  Vizster: visualizing online social networks , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[15]  Kim Marriott,et al.  Constrained Graph Layout , 1996, Constraints.

[16]  Ulrik Brandes,et al.  Dynamic WWW Structures in 3D , 2000, J. Graph Algorithms Appl..

[17]  G. W. Furnas,et al.  Generalized fisheye views , 1986, CHI '86.

[18]  P. Hartman Ordinary Differential Equations , 1965 .

[19]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Graph Drawing in Motion , 2022 .

[20]  Catherine Plaisant,et al.  SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[21]  Yaniv Frishmany,et al.  Online dynamic graph drawing , 2007 .

[22]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[23]  David A. Carrington,et al.  Graph Layout Aesthetics in UML Diagrams: User Preferences , 2002, J. Graph Algorithms Appl..

[24]  Robert F. Cohen,et al.  Online Animated Graph Drawing for Web Navigation , 1997, GD.

[25]  Peter J. Stuckey,et al.  Incremental Connector Routing , 2005, GD.

[26]  Joe Marks,et al.  An interactive constraint-based system for drawing graphs , 1997, UIST '97.

[27]  Jarke J. van Wijk,et al.  Interactive Visualization of Small World Graphs , 2004, IEEE Symposium on Information Visualization.

[28]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[29]  David Harel,et al.  ACE: a fast multiscale eigenvectors computation for drawing huge graphs , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[30]  Jens Gerken,et al.  IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs , 2006 .

[31]  Stephen C. North,et al.  Online Hierarchical Graph Drawing , 2001, GD.

[32]  Michael Golomb,et al.  Ordinary Differential Equations.@@@Differential Equations. , 1952 .

[33]  Kim Marriott,et al.  Drawing directed graphs using quadratic programming , 2006, IEEE Transactions on Visualization and Computer Graphics.

[34]  Sándor P. Fekete,et al.  Orthogonal Graph Drawing , 2001, Drawing Graphs.

[35]  Kim Marriott,et al.  Topology Preserving Constrained Graph Layout , 2009, GD.

[36]  Michael Jünger,et al.  Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.

[37]  Manojit Sarkar,et al.  Graphical fisheye views of graphs , 1992, CHI.

[38]  Michael Kaufmann,et al.  An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing , 2004, J. Graph Algorithms Appl..

[39]  Kim Marriott,et al.  Integrating Edge Routing into Force-Directed Layout , 2006, GD.

[40]  Colin Ware Interacting with Visualizations , 2004 .

[41]  Roberto Tamassia,et al.  Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications) , 2007 .

[42]  Ben Shneiderman,et al.  Balancing Systematic and Flexible Exploration of Social Networks , 2006, IEEE Transactions on Visualization and Computer Graphics.