Results 11 to 20 of about 898,897 (299)
Faster Edge‐Path Bundling through Graph Spanners [PDF]
AbstractEdge‐Path bundling is a recent edge bundling approach that does not incur ambiguities caused by bundling disconnected edges together. Although the approach produces less ambiguous bundlings, it suffers from high computational cost. In this paper, we present a new Edge‐Path bundling approach that increases the computational speed of the ...
Markus Wallinger +4 more
core +16 more sources
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach [PDF]
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
Markus Wallinger +4 more
core +8 more sources
Multilayer graph edge bundling [PDF]
Many real world information can be represented by a graph with a set of nodes interconnected with each other by multiple type of relations called edge layers (e.g., social network, biological data). Edge bundling techniques have been proposed to solve cluttering issue for standard graphs while few efforts were done to deal with the similar issue for ...
Romain Bourqui +3 more
openaire +4 more sources
StreamEB: Stream Edge Bundling. [PDF]
Graph streams have been studied extensively, such as for data mining, while fairly limitedly for visualizations. Recently, edge bundling promises to reduce visual clutter in large graph visualizations, though mainly focusing on static graphs. This paper presents a new framework, namely StreamEB, for edge bundling of graph streams, which integrates ...
Quan Hoang Nguyen 0001 +2 more
openaire +4 more sources
Force‐Directed Edge Bundling for Graph Visualization
AbstractGraphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this,
Holten, D.H.R., Wijk, van, J.J.
openaire +3 more sources
Edge routing with ordered bundles [PDF]
Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To produce aesthetically looking edge routes it minimizes a cost function on the edges.
Sergey Pupyrev +3 more
openaire +6 more sources
Edge Bundling with Divergence and Convergence
Naoki Hashimoto +2 more
openalex +2 more sources
Visual Explanations of Differentiable Greedy Model Predictions on the Influence Maximization Problem
Social networks have become important objects of study in recent years. Social media marketing has, for example, greatly benefited from the vast literature developed in the past two decades.
Mario Michelessa +5 more
doaj +1 more source
Evolutionary-Edge Bundling with Concatenation Process of Control Points
Edge bundling is one of the information visualization techniques, which bundle the edges of a network diagram based on certain rules to increase the visibility of the network diagram and facilitate the analysis of key relationships among nodes.
Ryosuke Saga, Jaeyoung Baek
openalex +2 more sources
In biology, we are often confronted with information-rich, large-scale trajectory data, but exploring and communicating patterns in such data can be a cumbersome task.
Johannes Waschke +6 more
doaj +2 more sources

