Scribd
Upload
127 views

Trees&Graphs

This document provides an overview of techniques for visualizing trees and graphs. It discusses the strengths and weaknesses of common tree visualizations like indented lists, node-link diagrams, layered diagrams, and treemaps. For graph visualization, it covers node-link diagrams and matrices. Recent research topics discussed include network comparison, heterogeneous networks, and dynamic networks. Active areas of research are highlighted, such as attribute-driven and hybrid representations that combine nodes, links, and matrices.

Uploaded by

Jordan Blevins
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
127 views

Trees&Graphs

This document provides an overview of techniques for visualizing trees and graphs. It discusses the strengths and weaknesses of common tree visualizations like indented lists, node-link diagrams, layered diagrams, and treemaps. For graph visualization, it covers node-link diagrams and matrices. Recent research topics discussed include network comparison, heterogeneous networks, and dynamic networks. Active areas of research are highlighted, such as attribute-driven and hybrid representations that combine nodes, links, and matrices.

Uploaded by

Jordan Blevins
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 100

Trees & Graphs

Nathalie Henry Riche, Microsoft Research


About

Nathalie Henry Riche


[email protected]
Researcher @ Microsoft Research since 2009

Today:
- Overview of techniques to visualize trees & graphs
- Their strengths & weaknesses
- Areas for future research
What’s in a graph?
What’s in a graph?
What’s in a graph?
What’s in a graph?
What’s in a graph?
What’s in a graph?
What’s in a graph?
Everything can be a graph!
What questions might we ask?

• How does the brain organize itself to achieve a


function?
• How does knowledge disseminate in online
communities?
• How are two graphs similar?
• Which entities in a social network might be
terrorists?
Graph Drawing

The primary concern of graph drawing is


the spatial arrangement of nodes and links

Often (but not always) the goal is


to effectively depict the graph structure:
• Connectivity patterns
• Partitions / Clusters
• Outliers
Putting things into perspective
Putting things into perspective
Putting things into perspective
Outline

Tree visualization

Graph visualization
- node-link diagrams
- matrices

Recent research topics


Trees
4 Major tree visualizations

Indented lists

Node-link trees

Layered diagrams

Treemaps
Indented List

Places all items along


vertically spaced rows
Indentation used to
show parent/child
relationships
Commonly used as a
component in an
interface
Breadth and depth
contend for space
Often requires a great
deal of scrolling
Interaction can help

OrthoZoom, Appert et al., CHI 2006


http://www.lri.fr/~appert/website/orthozoom/orthozoom.html
Interaction can help

OrthoZoom, Appert et al., CHI 2006


http://www.lri.fr/~appert/website/orthozoom/orthozoom.html
Node-Link Trees

Nodes are distributed in


space, connected by straight
or curved lines.

Typical approach is to use


2D space to break apart
breadth and depth.

Reingold-Tilford algorithm
achieves linear time
Node-Link Trees

Radial layout places the


root in the center.

The radius encodes the


depth.
Other node-Link trees

ThreadArcs,
Kerr,
2003

PhylloTrees,
Neumann et al.,
Eurovis 2006

http://treevis.net
Layered diagrams

Signify tree structure using


 Layering
 Adjacency
 Alignment

Involves recursive sub-division of space


We can apply the same set of approaches as in
node-link layout.
Layered diagrams

Icicle Trees SunBurst, Stasko et al.,


Infovis 2000
Treemaps
Encode hierarchy using spatial enclosure
Space-filling technique

http://www.cs.umd.edu/hcil/treemap-history/
Treemaps

Benefits
Provides a single view of an entire tree
Easier to spot large/small nodes

Problems
Difficult to accurately read depth
Hybrids

Elastic Hierarchies, Zhao et al., Infovis 2005


Hybrids

Elastic Hierarchies, Zhao et al., Infovis 2005


The issue of scale
Hyperbolic Space
Hyperbolic Tree Browser

Hyberbowlic tree browser, Lamping et al., CHI 1995


Aggregation

SpaceTree, Grosjean et al., Infovis 2002


Aggregation

SpaceTree, Grosjean et al., Infovis 2002


Degree-of-interest trees
Degree-of-interest trees
Degree-of-interest trees

Cull “un-interesting” nodes on a per block basis until


all blocks on a level fit within bounds.
Attempt to center child blocks beneath parents.
Graphs
Graph Visualization

Two representations:
- Node-link diagrams
- Matrices

Major Node-Link Layouts


Scalability issues and solutions
Matrix-based representations
See the tree in this graph?

Many graphs are tree-like or


have useful spanning trees

Spanning trees lead to


arbitrary roots

Fast tree layouts allow graph


layouts to be recalculated at
interactive rates
See the tree in this graph?

Animated Graphs with Radial Layout, Yee et al., Infovis 2001


http://www.youtube.com/watch?v=OPX5iGro_lA
See the tree in this graph?

TreePlus, Lee et al., VAST 2006


Hierarchical graph layout

Sugiyama-style or
layered graph
drawing

Layout of a Direct
Acyclic Graph

Hierarchical layering
based on descent
Hierarchical graph layout
Optimization techniques
Treat layout as an optimization problem

- Define layout using an energy model and/or a set of constraints:


equations the layout should try to obey
- Use optimization algorithms to solve

Regularly used for undirected graphs


- Force-Directed Layout most common

We can introduce directional constraints


- DiG-CoLa (Di-Graph Constrained Optimization Layout) [Dwyer 05]
- Iterative constraint relaxation
“Aesthetic” constraints

Minimize edge crossings


Minimize area
Minimize line bends
Minimize line slopes
Maximize smallest angle between edges
Maximize symmetry

but, can’t do it all.


Force-directed layout

Nodes = charged particles F = G*m1*m2 / (xi – xj)2


with air resistance F = -b * vi
Edges = springs F = -k * (xi – xj – L)

Repeatedly calculate forces, update node positions


- Naïve approach O(N2)
- Speed up to O(N log N) using quadtree or k-d tree
- Numerical integration of forces at each time step
Ego-Centered Networks

Vizster, Heer et al., Infovis 2005


Filtered Networks

Social Action, Perer et al., Infovis 2006


Constraint Optimization layout

Minimize stress function


stress(X) = Σi<j wij ( ||Xi-Xj|| - dij )2
 X: node positions, d: optimal edge length,
 w: normalization constants
 Use global (majorization) or localized (gradient descent)
optimization
 Says: Try to place nodes dij apart

Add hierarchy ordering constraints


EH(y) = Σ(i,j)E ( yi - yj - δij )2
 y: node y-coordinates
 δ : edge direction (e.g., 1 for ij, 0 for undirected)
 Says: If i points to j, it should have a lower y-value
Constraint Optimization layout

Sugiyama layout (dot)


Preserve tree structure

DiG-CoLa method
Preserve edge lengths
Constraint-based layout

http://marvl.infotech.monash.edu/webcola/
Coping with messiness
Layout Interaction Techniques

HotBox, McGuffin et al., Infovis 2009


Layout Interaction Techniques

HotBox, McGuffin et al., Infovis 2009


Edge Interaction Techniques

Multitouch Edge Interaction, Schmidt et al., ITS 2010


Edge Bundling
Hierarchical Edge Bundling

Use the hierarchy to


bundle edges

Holten, Infovis 2006


Interactive Bundling

MoleView, Hurter et al., Infovis 2011


Interactive Bundling

Curvature in Networks, Henry Riche et al., AVI 2012


The issue of scale
Solutions

Extracting network motifs


Taking advantage of node attributes
to layout/filter
to aggregate
Degree-of-Interest graphs
Use the alternative representation
Motifs

Motifs, von Landsberger et al., VAST 2009


Motifs of higher order

Motifs, Dunne et al., CHI 2013


Attribute-driven layout

Large node-link diagrams get messy!


Is there additional structure we can exploit?

Idea: Use data attributes to perform layout


e.g., scatter plot based on node values

Dynamic queries and/or brushing can be used to explore


connectivity
Attribute-driven layout

Semantic Substrates, Shneiderman et al., Infovis 2006


Attribute-driven layout

GraphDice, Bezerianos et al., Eurovis 2010


Attribute-driven layout

GraphDice, Bezerianos et al., Eurovis 2010


Hierarchical Aggregation

ASK-GraphView, Abello et al., Infovis 2006


Attribute-driven aggregation
PivotGraph
PivotGraph Matrices

PivotGraph Matri
GraphTrail

GraphTrail, Dunne et al., CHI 2012


Degree-of-Interest Graphs

Search, Show Context, Expand, Perer et al., Infovis 2009


Search & Browse

PivotPaths, Doerk et al., Infovis 2012


Use the Alternative
Matrices
Matrices
one year of email between ~500 researchers

= =
The Reorderable Matrix

Jacques
Bertin
1967
Revealing patterns
Matrix vs Node-Link

 Require learning  Familiar

 No overlap  Node overlap


 No crossings  Link crossing
 Use a lot of space  More compact

 Dense graphs  Dense graphs


 Sparse graphs  Sparse graphs

Comparison Study, Ghoniem et al., Information Visualization Journal 2005


Learning phase
Matrix + Node-Link

MatrixExplorer, Henry et al., Infovis 2006


Following paths in Matrices
Navigation Techniques

Melange, Elmqvist et al., CHI 2008


Hierarchical Aggregation

MatrixZoom

MatrixZoom, van Ham, Infovis 2003


Attribute-driven Aggregation

Honeycomb, van Ham et al., Interact 2009


Hybrid Graph Representation

NodeTrix

NodeTrix, Henry et al., Infovis 2008


Hybrid Graph Representation

NodeTrix
Active research topics

Network Comparison
Heterogeneous Networks
Dynamic Networks
Comparing Networks

ManyNets, Freire et al., CHI 2010


Comparing Weigthed Networks

Comparison Matrix, Alper et al., CHI 2013


Heterogeneous Networks

Orion/ploceus
OntoTrix/Multilinks
comparison
Heterogeneous Networks

Curvature in Networks, Henry Riche et al., AVI 2012


Dynamic graphs

Graph Diaries, Bach et al., TVCG 2013


Dynamic graphs

Cubix, Bach et al., CHI 2014


Dynamic graphs
Summary

Fast algorithms exists for tree visualizations

While most familiar representations, node-link diagrams


have many issues
- Several can be fixed by interaction techniques
- Others require using different visualization paradigms,
such as matrices

Graph visualization is still an active research topic!!

You might also like