MLSEB: edge bundling using moving least squares approximation

From MaRDI portal
Publication:4625129

DOI10.1007/978-3-319-73915-1_30zbMATH Open1503.68237arXiv1709.01221OpenAlexW2964030233MaRDI QIDQ4625129FDOQ4625129


Authors: Jieting Wu, Jianping Zeng, Feiyu Zhu, Hongfeng Yu Edit this on Wikidata


Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs.


Full work available at URL: https://arxiv.org/abs/1709.01221




Recommendations




Cites Work


Cited In (7)





This page was built for publication: MLSEB: edge bundling using moving least squares approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625129)