Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

  title={Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach},
  author={Mark Wallinger and Daniel W. Archambault and David Auber and Martin N{\"o}llenburg and Jaakko Peltonen},
  journal={IEEE Transactions on Visualization and Computer Graphics},
Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the… 

Figures and Tables from this paper


Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization
It is found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty, and compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.
State of the Art in Edge and Trail Bundling Techniques
A data‐based taxonomy is proposed that organizes bundling methods on the type of data they work on (graphs vs trails), and a generic framework that describes the typical steps of all bundling algorithms in terms of high‐level operations is proposed.
Divided Edge Bundling for Directional Network Data
The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk's force-directed edge bundling employs a
An Information-Theoretic Framework for Evaluating Edge Bundling Visualization
This paper illustrates the advantage of edge bundling visualizations for large graphs, and pinpoint the ambiguity resulting from drawing results, and proposes an information-theoretic framework to evaluate the visual results of edge Bundling techniques.
Multilevel agglomerative edge bundling for visualizing large graphs
This work proposes a multilevel agglomerative edge bundling method based on a principled approach of minimizing ink needed to represent edges, with additional constraints on the curvature of the resulting splines.
Force‐Directed Edge Bundling for Graph Visualization
This work presents a new edge bundling method that uses a self‐organizing approach to bundling in which edges are modeled as flexible springs that can attract each other, in contrast to previous methods, which require the graph to contain a hierarchy for this.
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance
Experimental results with social networks, biological networks, geographic networks and clustered graphs indicate that the new framework for edge bundling can be very useful to highlight the most important topological skeletal structures of the input networks.
Winding Roads: Routing edges into bundles
This paper introduces an intuitive edge bundling technique which efficiently reduces edge clutter in graphs drawings and a GPU‐based rendering method which helps users perceive bundles densities while preserving edge color.
Edge Routing with Ordered Bundles
A new and efficient algorithm is provided that solves a variant of the metro-line crossing minimization problem and creates aesthetically pleasing edge routes that give an overview of the global graph structure, while still drawing each edge separately, without intersecting graph nodes, and with few crossings.
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
This paper presents an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph that makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface.