An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs

We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understanding of tradeoffs and best practices for the representation of edges in directed graphs and to help practitioners choose among different options. Our work applies to graphs in which directed links are depicted using lines connecting the nodes. We tested five different edge representations chosen carefully based on user feedback to thoroughly cover the directed-edge design space. We also investigated how the use of pattern compression affects performance and subjective user preference. The article presents detailed results regarding the significant performance and preference differences between directed-edge representations and provides practical recommendations on their use.

[1]  Colin Ware,et al.  Visualizing graphs in three dimensions , 2008, TAP.

[2]  Jean-Daniel Fekete,et al.  Performance Evaluation of Tapered, Curved, and Animated Directed-Edge Representations in Node-Link Graphs , 2010 .

[3]  P. John Clarkson,et al.  Matrices or Node-Link Diagrams: Which Visual Representation is Better for Visualising Connectivity Models? , 2006, Inf. Vis..

[4]  Inanç Birol,et al.  ABySS-Explorer: Visualizing Genome Sequence Assemblies , 2009, IEEE Transactions on Visualization and Computer Graphics.

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

[6]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[7]  Jarke J. van Wijk,et al.  A user study on visualizing directed edges in graphs , 2009, CHI.

[8]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[9]  Robert S. Laramee,et al.  Smooth Graphs for Visual Exploration of Higher-Order State Transitions , 2009, IEEE Transactions on Visualization and Computer Graphics.

[10]  Graham J. Wills,et al.  Visualizing Network Data , 2009, Encyclopedia of Database Systems.

[11]  Werner Purgathofer,et al.  A Guided Tour to Wonderland : Visualizing the Slow-Fast Dynamics of an Analytical Dynamical System , 2008 .

[12]  Guy Melançon,et al.  Just how dense are dense graphs in the real world?: a methodological note , 2006, BELIV '06.

[13]  David Auber,et al.  Tulip - A Huge Graph Visualization Framework , 2004, Graph Drawing Software.

[14]  Pak Chung Wong,et al.  Dynamic visualization of graphs with extended labels , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[15]  Emden R. Gansner,et al.  Graphviz and Dynagraph – Static and Dynamic Graph Drawing Tools , 2003 .

[16]  Lyn Bartram,et al.  Animating Causal Overlays , 2008, Comput. Graph. Forum.

[17]  Yehuda Koren,et al.  Graph Drawing by Stress Majorization , 2004, GD.

[18]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[19]  M. Sheelagh T. Carpendale,et al.  ArcTrees: Visualizing Relations in Hierarchical Data , 2005, EuroVis.

[20]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[21]  Philippe Castagliola,et al.  A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations , 2004, IEEE Symposium on Information Visualization.

[22]  Jean-Daniel Fekete,et al.  Overlaying Graph Links on Treemaps , 2003 .

[23]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[24]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[25]  Colin Ware,et al.  Motion to support rapid interactive queries on node--link diagrams , 2004, TAP.

[26]  Martin Wattenberg,et al.  Arc diagrams: visualizing structure in strings , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..