Journal article 501 views 52 downloads
Faster Edge‐Path Bundling through Graph Spanners
,
David Auber,
Martin Nöllenburg,
Jaakko Peltonen
Computer Graphics Forum
Swansea University Author:
Daniel Archambault
-
PDF | Version of Record
© 2023 The Authors.Computer Graphics Forum published by Eurographics - The European Association for Computer Graphics and John Wiley & Sons Ltd.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium,provided the original work is properly cited.
Download (1.8MB)
DOI (Published version): 10.1111/cgf.14789
Abstract
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 inc...
| Published in: | Computer Graphics Forum |
|---|---|
| ISSN: | 0167-7055 1467-8659 |
| Published: |
Wiley
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa62893 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
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. |
|---|---|
| Keywords: |
Computational geometry, information visualization, visualization |
| College: |
Faculty of Science and Engineering |