The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Force‐Directed Edge Bundling for Graph Visualization
Abstract
Graphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this, or they construct a control mesh to guide the edge bundling process, which often results in bundles that show considerable variation in curvature along the overall bundle direction. We present 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, no hierarchy is used and no control mesh. The resulting bundled graphs show significant clutter reduction and clearly visible high‐level edge patterns. Curvature variation is furthermore minimized, resulting in smooth bundles that are easy to follow. Finally, we present a rendering technique that can be used to emphasize the bundling.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
An algorithm for drawing general undirected graphs
Kamada, T., & Kawai, S. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90102-6 · Cited by 2,698
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
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
Holten, D. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.147 · Cited by 970
Self-citationGraph Drawing by Stress Majorization
Gansner, E. R., Koren, Y., & North, S. C. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_25 · Cited by 403
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
A Taxonomy of Clutter Reduction for Information Visualisation
Ellis, G., & Dix, A. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70535 · Cited by 375
Drawing Graphs: Methods and Models
(2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44969-8 · Cited by 313
Cited by
Visual analytics in urban computing: An overview
Zheng, Y., Wu, W., Chen, Y., Qu, H., & Ni, L. M. (2016) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2586447 · Cited by 141
Analysis and visualisation of movement: an interdisciplinary review
Demšar, U., Buchin, K., Cagnacci, F., Safi, K., Speckmann, B., Van de Weghe, N., Weiskopf, D., & Weibel, R. (2015) · Movement Ecology · doi:10.1186/s40462-015-0032-y · Cited by 128
Bottger, J., Schafer, A., Lohmann, G., Villringer, A., & Margulies, D. S. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.114 · Cited by 59
Meng, F., Lu, Z., Li, X., Han, W., Peng, J., Liu, X., & Niu, Z. (2024) · Energy · doi:10.1016/j.energy.2024.130303 · Cited by 43
Heberle, H., Carazzolle, M. F., Telles, G. P., Meirelles, G. V., & Minghim, R. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1787-5 · Cited by 21
“ForceBundle) of ForceDirected Edge Bundling [36] in CellNetVis.”
Method
Metadata
- Authors
- Holten, D., & Van Wijk, J. J.
- Venue
- Computer Graphics Forum
- Publisher
- Wiley
- Published
- 2009-06
- Volume
- 28
- Issue
- 3
- Pages
- 983-990
- ISSN
- 0167-7055 (ISSN-L)
- 1467-8659
- OpenAlex
- W2117088188
- Cited by
- 522
- References
- 13
- FWCI
- 24.19
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Force‐Directed Edge Bundling for Graph Visualization. https://app.cochat.ai/papers/10.1111/j.1467-8659.2009.01450.x
- The paper
- Holten, D., & Van Wijk, J. J. (2009). Force‐Directed Edge Bundling for Graph Visualization. Computer Graphics Forum. https://doi.org/10.1111/j.1467-8659.2009.01450.x
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.
