MLSEB: Edge Bundling using Moving Least Squares Approximation

09/05/2017
by   Jieting Wu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2023

Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling

Diffusion-based generative graph models have been proven effective in ge...
research
04/14/2021

Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time

We present an algorithm that enumerates and classifies all edge-to-edge ...
research
08/21/2019

A Quality Metric for Visualization of Clusters in Graphs

Traditionally, graph quality metrics focus on readability, but recent st...
research
06/09/2023

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs

Let G be a graph in which each edge is assigned one of the colours 1, 2,...
research
08/31/2020

Extremal results for graphs of bounded metric dimension

Metric dimension is a graph parameter motivated by problems in robot nav...
research
09/07/2023

Filtration Surfaces for Dynamic Graph Classification

Existing approaches for classifying dynamic graphs either lift graph ker...

Please sign up or login with your details

Forgot password? Click here to reset