Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

08/11/2021
by   Markus Wallinger, et al.
0

Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.

READ FULL TEXT

page 1

page 8

page 9

research
05/16/2023

Lower Bounds for Non-Adaptive Shortest Path Relaxation

We consider single-source shortest path algorithms that perform a sequen...
research
08/22/2022

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

The shortest path problem in graphs is a cornerstone for both theory and...
research
12/11/2019

Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

The approximate single-source shortest-path problem is as follows: given...
research
02/17/2022

Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth

Shortest path graph distances are widely used in data science and machin...
research
03/13/2018

Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges

Motion-planning problems, such as manipulation in cluttered environments...
research
07/10/2022

Closing the Gap Between Directed Hopsets and Shortcut Sets

For an n-vertex directed graph G = (V,E), a β-shortcut set H is a set of...
research
08/20/2022

Visual Analysis of Neural Architecture Spaces for Summarizing Design Principles

Recent advances in artificial intelligence largely benefit from better n...

Please sign up or login with your details

Forgot password? Click here to reset