Fast and Faithful Edge Bundling using Spectral Sparsification

Xingjue Jiang; Seok-Hee Hong; Amyra Meidiana; Xianyuan Zeng

Home/Archive/arXiv

arXiv · 2604.26994

Fast and Faithful Edge Bundling using Spectral Sparsification

Xingjue Jiang·Seok-Hee Hong·Amyra Meidiana·Xianyuan Zeng

View original source ↗Read source document ↗Export metadata ↓

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, we present a general framework FEB (Fast Edge Bundling) utilizing spectral sparsification to improve the efficiency of existing bundling methods while maintaining a similar quality. We also present FBQ (Fast Bundling Quality) framework for proxy bundle faithfulness metrics, for measuring how FEB faithfully preserves the ground truth structure in the original edge bundling, with two variants, FBQ_JS (utilizing Jaccard Similarity) and FBQ_SQ (utilizing sampling quality metrics). Extensive experiments using various real-world and synthetic graphs demonstrate the effectiveness of SEB for edge bundling, outperforming state-of-art bundling methods on quality metrics, with 46% and 17% average improvement in distortion and ambiguity respectively for SEB2. Furthermore, experiments successfully demonstrate the efficiency of the FEB framework, with 61% runtime improvement over the original edge bundling methods without sparsification, while maintaining a similar quality, with 74% similarity based on FBQ_SQ.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Xingjue Jiang, Seok-Hee Hong, Amyra Meidiana, Xianyuan Zeng. 2026-04-28. Fast and Faithful Edge Bundling using Spectral Sparsification. https://arxiv.org/abs/2604.26994

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗