Sankey Arcs - Visualizing edge weights in path graphs

Sankey Arcs – Visualizingedge weights in path graphsTill Nagel, Erik Duval, Andrew Vande Moere, Kristian Kloeckl and Carlo Ratti

Arc diagrams

Wattenberg, 2002 Steinweber and Koller, 2007Heer et al, 2010 Kerr, 2003Dörk et al, 2011 Wattenberg, 2006

Design goals•  Display node strength independent of edge distribution•  Enable comparison of in-weight and out- weight•  Emphasize total weight of a node

Spreading out impostsClassic Arcs Sankey Arcs

AlgorithmClassic arc diagram Spread out arc bases Reordered head and tail positions

Color coding for direction

Limitations•  Consumes more space•  Arc height does not always encode distance

Arc height does not always encode distance

Consumes more space

Consumes more spaceSolution a)Adapt node positioningEqui-distant nodes Equi-sized gaps

Consumes more spaceSolution b)Modify visual encoding

Scalability Heer et al, 2010 Showing character relationships of the novel Les Misérables.

Scalability Reproduction Removed color (encoded character groups). Fixed edge width. Improved label display.

Sankey Arcs: Repositioned nodes

Sankey Arcs: Adjusted visual mapping

Case study: Public transit rides

Ridership Visualization

Sankey Arcs•  Display edge weights in path graph•  Have less visual obstruction by spreading out arcs•  Allow comparing strength, and in- and out- weights of nodes

Thank you. Questions?Sankey Arcs, EuroVis 2012 Till Nagel, FH Potsdam, 06/2012 nagel@fh-potsdam.de – twitter: @tillnm

Sankey Arcs - Visualizing edge weights in path graphs

by Till Nagel on Jun 06, 2012

Accessibility

Categories

Upload Details

Usage Rights

Statistics

Sankey Arcs - Visualizing edge weights in path graphs Presentation Transcript