Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-Off

Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual edges. We propose a solution: we optimize edge coloring to differentiate bundled edges. We quantify strength of bundling in a flexible pairwise fashion between edges, and among bundled edges, we quantify how dissimilar their colors should be by dissimilarity of their origins and destinations. We solve the resulting nonlinear optimization, which is also interpretable as a novel dimensionality reduction task. In large graphs the necessary compromise is whether to differentiate colors sharply between locally occurring strongly bundled edges (“local bundles”), or also between the weakly bundled edges occurring globally over the graph (“global bundles”); we allow a user-set global-local tradeoff. We call the technique “peacock bundles”. Experiments show the coloring clearly enhances comprehensibility of graph layouts with edge bundling.

[1]  Kwan-Liu Ma,et al.  Ambiguity-Free Edge-Bundling for Interactive Graph Visualization , 2012, IEEE Transactions on Visualization and Computer Graphics.

[2]  Tovi Grossman,et al.  The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor's activation area , 2005, CHI.

[3]  Hong Zhou,et al.  Edge bundling in information visualization , 2013 .

[4]  Hong Zhou,et al.  Geometry-Based Edge Clustering for Graph Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.

[5]  P. Groenen,et al.  Modern multidimensional scaling , 1996 .

[6]  Jeffrey Heer,et al.  SpanningAspectRatioBank Easing FunctionS ArrayIn ColorIn Date Interpolator MatrixInterpola NumObjecPointI Rectang ISchedu Parallel Pause Scheduler Sequen Transition Transitioner Transiti Tween Co DelimGraphMLCon IData JSONCon DataField DataSc Dat DataSource Data DataUtil DirtySprite LineS RectSprite , 2011 .

[7]  Christophe Hurter,et al.  Skeleton-Based Edge Bundling for Graph Visualization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[8]  Jarke J. van Wijk,et al.  Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.

[9]  D. Weiskopf Image-Based Edge Bundles: Simplified Visualization of Large Graphs , 2010 .

[10]  Paul Vickers,et al.  A survey of two-dimensional graph layout techniques for information visualisation , 2013, Inf. Vis..

[11]  Jeffrey Heer,et al.  D³ Data-Driven Documents , 2011, IEEE Transactions on Visualization and Computer Graphics.

[12]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

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

[14]  Emden R. GansnerYifan Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs , 2011 .

[15]  Samuel Kaski,et al.  Graph visualization with latent variable models , 2010, MLG '10.

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

[17]  Michael Kaufmann,et al.  Improving Layered Graph Layouts with Edge Bundling , 2010, GD.

[18]  Christophe Hurter,et al.  Graph Bundling by Kernel Density Estimation , 2012, Comput. Graph. Forum.

[19]  Afonso Paiva,et al.  Colorization by Multidimensional Projection , 2012, 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images.

[20]  Jeffrey Heer,et al.  Color naming models for color selection, image editing and palette design , 2012, CHI.

[21]  Cláudio T. Silva,et al.  Interactive Vector Field Feature Identification , 2010, IEEE Transactions on Visualization and Computer Graphics.