Faster Edge‐Path Bundling through Graph Spanners

Simple item page
dc.contributor.authorWallinger, Markusen_US
dc.contributor.authorArchambault, Danielen_US
dc.contributor.authorAuber, Daviden_US
dc.contributor.authorNöllenburg, Martinen_US
dc.contributor.authorPeltonen, Jaakkoen_US
dc.contributor.editorHauser, Helwig and Alliez, Pierreen_US
dc.date.accessioned2023-10-06T11:58:54Z
dc.date.available2023-10-06T11:58:54Z
dc.date.issued2023
dc.description.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 – times faster than Edge‐Path bundling depending on the dataset, which brings its practical running time more in line with traditional edge bundling algorithms.en_US
dc.description.number6
dc.description.sectionheadersORIGINAL ARTICLES
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume42
dc.identifier.doi10.1111/cgf.14789
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.14789
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf14789
dc.publisher© 2023 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectcomputational geometry
dc.subjectinformation visualization
dc.subjectvisualization
dc.titleFaster Edge‐Path Bundling through Graph Spannersen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
v42i6_33_14789.pdf
Size:
1.83 MB
Format:
Adobe Portable Document Format
Download
Collections
42-Issue 6