Wallinger, MarkusArchambault, DanielAuber, DavidNöllenburg, MartinPeltonen, JaakkoHauser, Helwig and Alliez, Pierre2023-10-062023-10-0620231467-8659https://doi.org/10.1111/cgf.14789https://diglib.eg.org:443/handle/10.1111/cgf14789Edge‐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 – times faster than Edge‐Path bundling depending on the dataset, which brings its practical running time more in line with traditional edge bundling algorithms.Attribution 4.0 International Licensecomputational geometryinformation visualizationvisualization10.1111/cgf.14789