Animated Exploration of Graphs with Radial Layout IEEE InfoVis 2001 Ka-Ping Yee Rachna Dhamija Danyel Fisher Marti Hearst University of California, Berkeley 1Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

overview objective related work radial graph layout animation technique applications evaluation 2Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

objective use focus+context style explore interactively show network distances allow general graphs, not just trees 3Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

example 4Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

related work layout: P. Eades: drawing free trees, 1992 G. Wills: NicheWorks, 1997 T. Munzner: H3, 1997 animation: B. Chang and D. Ungar, Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout 6Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout find spanning tree, starting at focus 7Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout each immediate neighbour is a child 8Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout allocate angle proportional to child’s total size 9Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout allocate angle proportional to child’s total size 10Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout allocate angle proportional to child’s total size 11Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout allocate angle proportional to child’s total size 12Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

radial layout allocate angle proportional to child’s total size 13Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

animation select a new focus provide a smooth transition keep the user oriented 14Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

coordinate space rectangular nodes crowd into center polar smoother movement consistent radial distance 15Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

rectangular 16Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

polar 17Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

consistency constraints maintain direction from new focus to its parent maintain ordering of children around nodes 18Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

without constraints 19Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

with constraints 20Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

animation timing slow-in, slow-out gives a moment to anticipate motion 21Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

linear timing 22Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

slow-in, slow-out 23Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

usability study out of 10 participants, number preferring tool with technique over one without: small graphlarge graph 16 nodes200 nodes polar coordinates3/108/10 constraints5/106/10 slow-in, slow-out8/108/10 all techniques5/109/10 24Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

Gnutella a peer-to-peer file-sharing network nodes send queries via their neighbours send “ping” packets to discover nodes 25Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

Gnutella node colour: connection state node size: shared files query strings over nodes 26Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

social networks “Florentine families” data set degrees of separation from any node readily apparent 27Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

heavily connected graphs get messy can’t handle very large graphs: should aggregate distant nodes limitations 28Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)

contributions animated transitions polar coordinate space consistency constraints slow-in, slow-out timing handles dynamic graphs shows network distance 29Animated Exploration of Graphs (Yee, Dhamija, Fisher, Hearst)