Fast and Faithful Edge Bundling using Spectral Sparsification
Xingjue Jiang, Seok-Hee Hong, Amyra Meidiana, Xianyuan Zeng

TL;DR
This paper introduces spectral sparsification-based edge bundling methods that significantly improve the quality and efficiency of graph visualization by reducing distortion, ambiguity, and computational complexity.
Contribution
It proposes new spectral edge bundling and fast bundling frameworks that preserve structural properties and enhance efficiency compared to existing methods.
Findings
SEB outperforms state-of-the-art bundling methods in quality metrics.
FEB achieves 61% runtime improvement while maintaining bundling quality.
Experiments demonstrate effectiveness on real-world and synthetic graphs.
Abstract
Edge bundling reduces the visual complexity of drawings of large and complex graphs by clustering "compatible" edges. However, it often introduces distortion by bundling "unrelated" edges, resulting in misleading, ambiguous drawings. Moreover, existing edge bundling methods often have high computational complexity. We present new edge bundling methods and faithfulness metrics for edge bundling using spectral sparsification, which sparsifies a graph G into a subgraph G' with O(n log n) edges, based on the effective resistance values of edges, preserving the spectrum of G, closely related to important structural properties of G, such as connectivity, clustering, and the commute distance. We first present a new edge bundling method SEB (Spectral Edge Bundling), introducing effective resistance-based compatibility for spectral-faithful bundling, improving distortion and ambiguity. Then,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
