State of the art in edge and trail bundling techniques

A Lhuillier, C Hurter, A Telea - Computer Graphics Forum, 2017 - Wiley Online Library
Bundling techniques provide a visual simplification of a graph drawing or trail set, by
spatially grouping similar graph edges or trails. This way, the structure of the visualization …

Force‐directed edge bundling for graph visualization

D Holten, JJ Van Wijk - Computer graphics forum, 2009 - Wiley Online Library
Graphs 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 …

Charticulator: Interactive construction of bespoke chart layouts

D Ren, B Lee, M Brehmer - IEEE transactions on visualization …, 2018 - ieeexplore.ieee.org
We present Charticulator, an interactive authoring tool that enables the creation of bespoke
and reusable chart layouts. Charticulator is our response to most existing chart construction …

Force-directed algorithms for schematic drawings and placement: A survey

SH Cheong, YW Si - Information Visualization, 2020 - journals.sagepub.com
Force-directed algorithms have been developed over the last 50 years and used in many
application fields, including information visualisation, biological network visualisation …

Skeleton-based edge bundling for graph visualization

O Ersoy, C Hurter, F Paulovich… - IEEE transactions on …, 2011 - ieeexplore.ieee.org
In this paper, we present a novel approach for constructing bundled layouts of general
graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are …

Graph bundling by kernel density estimation

C Hurter, O Ersoy, A Telea - Computer graphics forum, 2012 - Wiley Online Library
We present a fast and simple method to compute bundled layouts of general graphs. For
this, we first transform a given graph drawing into a density map using kernel density …

The atlas for the aspiring network scientist

M Coscia - arXiv preprint arXiv:2101.00863, 2021 - arxiv.org
Network science is the field dedicated to the investigation and analysis of complex systems
via their representations as networks. We normally model such networks as graphs: sets of …

IPSep-CoLa: An incremental procedure for separation constraint layout of graphs

T Dwyer, Y Koren, K Marriott - IEEE transactions on …, 2006 - ieeexplore.ieee.org
We extend the popular force-directed approach to network (or graph) layout to allow
separation constraints, which enforce a minimum horizontal or vertical separation between …

Bundled visualization of dynamicgraph and trail data

C Hurter, O Ersoy, SI Fabrikant… - IEEE transactions on …, 2013 - ieeexplore.ieee.org
Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We
present two techniques for simplified visualization of such data sets using edge bundles …

Attribute-driven edge bundling for general graphs with applications in trail analysis

V Peysakhovich, C Hurter… - 2015 IEEE Pacific …, 2015 - ieeexplore.ieee.org
Edge bundling methods reduce visual clutter of dense and occluded graphs. However,
existing bundling techniques either ignore edge properties such as direction and data …