File Exchange

image thumbnail

Divided edge bundling in Matlab

version 1.0.0.0 (326 KB) by Kelly Kearney
Calculate and plot graph divided edge bundle pathways for directional network graphs

1 Download

Updated 05 Jun 2018

GitHub view license on GitHub

These two functions replicate the divided edge bundling algorithm, which provides an edge-routing method to declutter complex directional network graphs while highlighting major directional edge pathways. The algorithm, which is an extention of force-directed edge bundling, was developed by David Selassie and is described in the following paper:
- Selassie D, Heller B, Heer J (2011) Divided edge bundling for directional network data. IEEE Trans Vis Comput Graph 17:2354-2363

Please note that I am not a coauthor on this paper; I simply coded this Matlab version so I could incorporate the divided edge bundling algorithm into my own research. While I would appreciate acknowledgement if you happen to use this particular implementation of the algorithm, please be sure to cite Salassie's paper as the primary citation.

See README (available in the package and displayed on Github) for further details and examples.

Cite As

Kelly Kearney (2019). Divided edge bundling in Matlab (https://www.github.com/kakearney/divedgebundle-pkg), GitHub. Retrieved .

Comments and Ratings (1)

Chenyu Fang

Updates

1.0.0.0

Edit typo in description

MATLAB Release Compatibility
Created with R2017a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

ConsoleProgressBar

InterPointDistanceMatrix

aggregate

catuneven

divedgebundle

interparc

minmax

singlepatch

InterPointDistanceMatrix