edgebundle

CRANedgebundleMaRDI QIDQ88070FDOQ88070

Algorithms for Bundling Edges in Networks and Visualizing Flow and Metro Maps

David Schoch

Last update: 16 December 2023

Copyright license: MIT license, File License

Software version identifier: 0.4.1, 0.2.0, 0.2.1, 0.3.0, 0.3.1, 0.4.0, 0.4.2

Description

Implements several algorithms for bundling edges in networks and flow and metro map layouts. This includes force directed edge bundling <doi:10.1111/j.1467-8659.2009.01450.x>, a flow algorithm based on Steiner trees<doi:10.1080/15230406.2018.1437359> and a multicriteria optimization method for metro map layouts <doi:10.1109/TVCG.2010.24>.

Cites work

• Force-Directed Edge Bundling for Graph Visualization
• A spatial one-to-many flow layout algorithm using triangulation, approximate Steiner trees, and path smoothing
• Automatic Metro Map Layout Using Multicriteria Optimization

This page was built for software: edgebundle