The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Graph Drawing: Algorithms for the Visualization of Graphs
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1998) · Iris (Roma Tre University) · Cited by 1,977
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
Tree visualization with tree-maps: 2-d space-filling approach
Shneiderman, B. (1992) · ACM Transactions on Graphics · doi:10.1145/102377.115768 · Cited by 1,328
Robertson, G. G., Mackinlay, J. D., & Card, S. K. (1991) · doi:10.1145/108844.108883 · Cited by 1,156
Reingold, E. M., & Tilford, J. S. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.234519 · Cited by 505
Becker, R. A., Eick, S. G., & Wilks, A. R. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.468391 · Cited by 392
Drawing Graphs: Methods and Models
(2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44969-8 · Cited by 313
Visualization of structural information: automatic drawing of compound digraphs
Sugiyama, K., & Misue, K. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.108304 · Cited by 193
A Fast Multi-Scale Method for Drawing Large Graphs
Harel, D., & Koren, Y. (2002) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00051 · Cited by 169
Drawing Huge Graphs by Algebraic Multigrid Optimization
Koren, Y., Carmel, L., & Harel, D. (2003) · Multiscale Modeling and Simulation · doi:10.1137/s154034590241370x · Cited by 69
Cited by
Visual comparison for information visualization
Gleicher, M., Albers, D., Walker, R., Jusufi, I., Hansen, C. D., & Roberts, J. C. (2011) · Information Visualization · doi:10.1177/1473871611416549 · Cited by 567
NodeTrix: a Hybrid Visualization of Social Networks
Henry, N., Fekete, J.-D., & McGuffin, M. J. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70582 · Cited by 555
Force‐Directed Edge Bundling for Graph Visualization
Holten, D., & Van Wijk, J. J. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01450.x · Cited by 522
Self-citationVisual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines
Elmqvist, N., & Fekete, J.-D. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.84 · Cited by 381
Metadata
- Authors
- Holten, D.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2006-09
- Volume
- 12
- Issue
- 5
- Pages
- 741-748
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2145640629
- Cited by
- 970
- References
- 11
- FWCI
- 38.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.