Parallelized Force-Directed Edge Bundling on the GPU

2012 ◽  
Author(s):  
Delu Zhu ◽  
Kaichao Wu ◽  
Danhuai Guo ◽  
Yuanmin Chen
Keyword(s):  
Directed Edge ◽  
Edge Bundling

Interactive 3D Force-Directed Edge Bundling

2016 ◽  
Vol 35 (3) ◽  
pp. 51-60 ◽  
Author(s):  
D. Zielasko ◽  
B. Weyers ◽  
B. Hentschel ◽  
T. W. Kuhlen
Keyword(s):  
Directed Edge ◽  
Interactive 3D ◽  
Edge Bundling

scholarly journals Clarifying Origin-Destination Flows Using Force-Directed Edge Bundling Layout

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 62572-62583
Author(s):  
Liangkui Luo ◽  
Zhaocheng He ◽  
Yuhuan Lu ◽  
Jinyong Chen
Keyword(s):  
Directed Edge ◽  
Edge Bundling

Force-Directed Edge Bundling for Graph Visualization

2009 ◽  
Vol 28 (3) ◽  
pp. 983-990 ◽  
Author(s):  
Danny Holten ◽  
Jarke J. van Wijk
Keyword(s):  
Graph Visualization ◽  
Directed Edge ◽  
Edge Bundling

Understanding data dimensions by cluster visualization using edge bundling in parallel coordinates

2018 ◽  
Author(s):  
Rodrigo Santos do Amor Divino Lima ◽  
Carlos Gustavo Resque dos Santos ◽  
Sandro de Paula Mendonça ◽  
Jefferson Magalhães de Morais ◽  
Bianchi Serique Meiguins
Keyword(s):  
Parallel Coordinates ◽  
Cluster Visualization ◽  
Edge Bundling

scholarly journals Intrinsic linking and knotting in tournaments

2019 ◽  
Vol 28 (12) ◽  
pp. 1950076
Author(s):  
Thomas Fleming ◽  
Joel Foisy
Keyword(s):  
Directed Graph ◽  
Upper Bound ◽  
Directed Edge ◽  
Undirected Graphs ◽  
Oriented Cycle ◽  
Minimum Number ◽  
The Difference

A directed graph [Formula: see text] is intrinsically linked if every embedding of that graph contains a nonsplit link [Formula: see text], where each component of [Formula: see text] is a consistently oriented cycle in [Formula: see text]. A tournament is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intrinsic linking and knotting in tournaments, and study the minimum number of vertices required for a tournament to have various intrinsic linking or knotting properties. We produce the following bounds: intrinsically linked ([Formula: see text]), intrinsically knotted ([Formula: see text]), intrinsically 3-linked ([Formula: see text]), intrinsically 4-linked ([Formula: see text]), intrinsically 5-linked ([Formula: see text]), intrinsically [Formula: see text]-linked ([Formula: see text]), intrinsically linked with knotted components ([Formula: see text]), and the disjoint linking property ([Formula: see text]). We also introduce the consistency gap, which measures the difference in the order of a graph required for intrinsic [Formula: see text]-linking in tournaments versus undirected graphs. We conjecture the consistency gap to be nondecreasing in [Formula: see text], and provide an upper bound at each [Formula: see text].

scholarly journals Multilayer graph edge bundling

2016 ◽  
Author(s):  
Romain Bourqui ◽  
Dino Ienco ◽  
Arnaud Sallaberry ◽  
Pascal Poncelet
Keyword(s):  
Edge Bundling
Sign in / Sign up

Export Citation Format

Share Document