Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data

  title={Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data},
  author={Danny Holten},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  • Danny Holten
  • Published 1 September 2006
  • Computer Science
  • IEEE Transactions on Visualization and Computer Graphics
A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the… 
Visual analysis of compound graphs
  • Michael Burch
  • Computer Science
    2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)
  • 2016
This paper introduces a visualization tool that is able to provide linked views on both aspects of graph relations and the hierarchical organization, and illustrates the usefulness of the tool in a case study investigating soccer team results that build weighted directed adjacency relations in a hierarchically structured world.
Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts
This paper presents a novel edge bundling technique, called Similarity-Driven Edge Bundling (SDEB), which creates a similarity hierarchy based on a multilevel partition of the data, grouping edges considering the similarity between nodes to guide the bundling.
Cluster-based Edge Bundling based on a Line Graph
A new bundling method based on edge clustering is proposed, which shows most edges are clearly bundled whereas a few edges belonging to different clusters are not bundled.
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified visual
Node-Ring Graph Visualization Clears Edge Congestion
A new graph layout inspired by concentric circles, which have appeared in art in numerous diverse situations, is introduced: Node-Ring layout, where instead of the edges being represented as links, they are represented as colour rings located inside the node.
EdgeMaps: visualizing explicit and implicit relations
It is argued that the interactive exploration of interesting visual patterns emerge that resemble the aesthetics of fireworks and waves may allow the viewer to grasp the structure of a graph better than complex node-link visualizations.
Visualizing Group Structures in Graphs: A Survey
This work surveys research in visualizing group structures as part of graph diagrams, with a particular focus is the explicit visual encoding of groups, rather than only using graph layout to indicate groups implicitly.
A user study on visualizing directed edges in graphs
Five additional directed-edge representations using combinations of shape and color are developed and a user study is performed in which subjects performed different tasks on a collection of graphs using these representations and combinations to investigate which representation is best in terms of speed and accuracy.
Geometry-Based Edge Clustering for Graph Visualization
A novel geometry-based edge-clustering framework that can group edges into bundles to reduce the overall edge crossings is proposed, which is intuitive, flexible, and efficient.
Visual Comparison of Hierarchically Organized Data
A novel visualization method that visualizes a pair of hierarchies that are to be compared and simultaneously depicts how these hierarchies are related by explicitly visualizing the relations between matching subhierarchies is provided.


Overlaying Graph Links on Treemaps
A visualization technique that displays the tree structure as aTreemap and the remaining edges as curved links overlaid on the Treemap to show where the link starts and where it ends without requiring an explicit arrow that would clutter the already dense visualization.
Edgelens: an interactive method for managing edge congestion in graphs
The EdgeLens interactively curves graph edges away for a person's focus attention without changing the node positions, which opens up sufficient space to disambiguate node and edge relationships and to see underlying information while still preserving node layout.
Visualization of structural information: automatic drawing of compound digraphs
An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented, and a heuristic algorithm to generate readable diagrams is developed.
Tree visualization with tree-maps: 2-d space-filling approach
This paper deals with a two-dimensional space-filling approach in which each node is a rectangle whose area is proportional to some attribute such as node size.
H3: laying out large directed graphs in 3D hyperbolic space
  • T. Munzner
  • Computer Science
    Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium
  • 1997
The H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space is presented and its implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.
Elastic hierarchies: combining treemaps and node-link diagrams
We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or "interleaving", of more basic forms at different nodes of the tree.
ArcTrees: Visualizing Relations in Hierarchical Data
A hierarchical view derived from traditional Treemaps is proposed and augment this view with an arc diagram to depict relations, and interaction methods that allow the exploration of the data set using Focus+Context techniques for navigation are presented.
An Algorithm for Drawing Compound Graphs
A new algorithm, called Nuage, for drawing graphs with both adjacency and inclusion relationships between nodes, that is, compound graphs, which is more general than classical graph models or clustered graphs is presented.
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound graphs. A view is an
A space-optimized tree visualization
A new method for the visualization of tree structured relational data using the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves is described.