MLSEB: edge bundling using moving least squares approximation
From MaRDI portal
Publication:4625129
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Are crossings important for drawing large graphs?
- Curve reconstruction from unorganized points
- Improved Circular Layouts
- Improving layered graph layouts with edge bundling
- StreamEB: stream edge bundling
- Surfaces Generated by Moving Least Squares Methods
- TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
Cited in
(7)- StreamEB: stream edge bundling
- Edge routing with ordered bundles
- Edge routing with ordered bundles
- Peacock bundles: bundle coloring for graphs with globality-locality trade-off
- TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
- Stub bundling and confluent spirals for geographic networks
- Improving layered graph layouts with edge bundling
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)