Affiliation:
1. TU Wien Vienna Austria
2. Swansea University Swansea UK
3. University of Bordeaux Bordeaux France
4. Tampere University Tampere Finland
Abstract
AbstractEdge‐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.
Funder
Academy of Finland
UK Research and Innovation
Technische Universität Wien Bibliothek
Subject
Computer Graphics and Computer-Aided Design
Reference69 articles.
1. Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components
2. Graph spanners: A tutorial review
3. On sparse spanners of weighted graphs
4. [ADF*19] AlstrupS. DahlgaardS. FiltserA. StöckelM. Wulff‐NilsenC.:Constructing light spanners deterministically in near‐linear time. InProceedings of the 27th Annual European Symposium on Algorithms LIPIcs(2019) vol.144 pp.4:1–4:15. doi:10.4230/LIPIcs.ESA.2019.4
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献