The Community for Technology Leaders
Green Image
Issue No. 05 - September-October (2006 vol. 12)
ISSN: 1077-2626
pp: 741-748
D. Holten , Technische Univ. Eindhoven
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 polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations
Data visualization, Tree graphs, Wires, Cables, Spline, Software systems, Social network services, Displays, Tree data structures,treemaps., Network visualization, edge bundling, edge aggregation, edge concentration, curves, graph visualization, tree visualization, node-link diagrams, hierarchies
D. Holten, "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data", IEEE Transactions on Visualization & Computer Graphics, vol. 12, no. , pp. 741-748, September-October 2006, doi:10.1109/TVCG.2006.147
89 ms
(Ver 3.3 (11022016))