Toggle Main Menu Toggle Search

Open Access padlockePrints

Faster Edge-Path Bundling through Graph Spanners

Lookup NU author(s): Dr Daniel ArchambaultORCiD



This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).


© 2023 The Authors. Computer Graphics Forum published by Eurographics - The European Association for Computer Graphics and John Wiley & Sons Ltd. Edge-Path bundling is a recent edge bundling approach that does not incur ambiguities caused by bundling disconnected edges together. Although the approach produces less ambiguous bundlings, it suffers from high computational cost. In this paper, we present a new Edge-Path bundling approach that increases the computational speed of the algorithm without reducing the quality of the bundling. First, we demonstrate that biconnected components can be processed separately in an Edge-Path bundling of a graph without changing the result. Then, we present a new edge bundling algorithm that is based on observing and exploiting a strong relationship between Edge-Path bundling and graph spanners. Although the worst case complexity of the approach is the same as of the original Edge-Path bundling algorithm, we conduct experiments to demonstrate that the new approach is 5–256 times faster than Edge-Path bundling depending on the dataset, which brings its practical running time more in line with traditional edge bundling algorithms.

Publication metadata

Author(s): Wallinger M, Archambault D, Auber D, Nollenburg M, Peltonen J

Publication type: Article

Publication status: Published

Journal: Computer Graphics Forum

Year: 2023

Volume: 42

Issue: 6

Print publication date: 01/09/2023

Online publication date: 03/04/2023

Acceptance date: 02/04/2018

Date deposited: 15/09/2023

ISSN (print): 0167-7055

ISSN (electronic): 1467-8659

Publisher: John Wiley and Sons Inc.


DOI: 10.1111/cgf.14789


Altmetrics provided by Altmetric