Edge bundling methods reduce visual clutter of dense and occluded graphs. However, existing bundling techniques either ignore edge properties such as direction and data attributes, or are otherwise com-putationally not scalable, which makes them unsuitable for tasks such as exploration of large trajectory datasets. We present a new framework to generate bundled graph layouts according to any nu-merical edge attributes such as directions, timestamps or weights. We propose a GPU-based implementation linear in number of edges, which makes our algorithm applicable to large datasets. We demon-strate our method with applications in the analysis of aircraft trajec-tory datasets and eye-movement traces
Edge-Path bundling is a recent edge bundling approach that does not incur ambiguities caused by bund...
Graph streams have been studied extensively, such as for data mining, while fairly limitedly for vis...
We present a new method for bundling edges of general graphs, based on 2D medial axes of edge sets w...
International audienceEdge bundling methods reduce visual clutter of dense and occluded graphs. Howe...
Edge bundling methods reduce visual clutter of dense and occluded graphs. However, existing bundling...
the Netherlands Abstract — Depicting change captured by dynamic graphs and temporal paths, or trails...
A tremendous increase in the scale of graphs has been witnessed in a wide range of fields, which dem...
Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two t...
In this paper, we present a novel approach for constructing bundled layouts of general graphs. As la...
the Netherlands Abstract — Depicting change captured by dynamic graphs and temporal paths, or trails...
Bundling techniques provide a visual simplification of a graph drawing or trail set, by spatially gr...
Abstract—In this paper, we present a novel approach for constructing bundled layouts of general grap...
International audienceIn this paper, we present a novel approach for constructing bundled layouts of...
Edge bundling techniques provide a visual simplification of cluttered graph drawings or trail sets. ...
Edge-Path bundling is a recent edge bundling approach that does not incur ambiguities caused by bund...
Graph streams have been studied extensively, such as for data mining, while fairly limitedly for vis...
We present a new method for bundling edges of general graphs, based on 2D medial axes of edge sets w...
International audienceEdge bundling methods reduce visual clutter of dense and occluded graphs. Howe...
Edge bundling methods reduce visual clutter of dense and occluded graphs. However, existing bundling...
the Netherlands Abstract — Depicting change captured by dynamic graphs and temporal paths, or trails...
A tremendous increase in the scale of graphs has been witnessed in a wide range of fields, which dem...
Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two t...
In this paper, we present a novel approach for constructing bundled layouts of general graphs. As la...
the Netherlands Abstract — Depicting change captured by dynamic graphs and temporal paths, or trails...
Bundling techniques provide a visual simplification of a graph drawing or trail set, by spatially gr...
Abstract—In this paper, we present a novel approach for constructing bundled layouts of general grap...
International audienceIn this paper, we present a novel approach for constructing bundled layouts of...
Edge bundling techniques provide a visual simplification of cluttered graph drawings or trail sets. ...
Edge-Path bundling is a recent edge bundling approach that does not incur ambiguities caused by bund...
Graph streams have been studied extensively, such as for data mining, while fairly limitedly for vis...
We present a new method for bundling edges of general graphs, based on 2D medial axes of edge sets w...