Nov 26, 2009 IAT 800 1 Visualizing Trees ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS.

Slides:



Advertisements
Similar presentations
1 H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space Andrew Chan CPSC 533C March 24, 2003.
Advertisements

H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space Tamara Munzner, Stanford University.
Cushion Treemaps and Botanical Visualization Yimeng Dou
Trees and Cushions Jack van Wijk Eindhoven University of Technology Treemap Workshop, May 31, 2001 HCIL, University of Maryland.
Information Visualization: Trees Chris North cs3724: HCI.
Jun 2, 2014 IAT Trees2 Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE.
Visualisasi Informasi
LifeLines:Visualizing Personal Histories Plaisant, Milash, Rose, Widoff, Shneiderman Presented by Girish Kumar and Rajiv Gandhi.
Searching on Multi-Dimensional Data
From Hierarchies to Polyarchies: Visualizing Multiple Relationships George G. Robertson Microsoft Research George G. Robertson Microsoft Research.
Tree Drawing Algorithms and Visualization Methods Kai (Kevin) Xu.
Abstract Syntax Tree Rendering Noah Brickman CMPS 203.
1 Presented by Jean-Daniel Fekete. 2  Motivation  Mélange [Elmqvist 2008] Multiple Focus Regions.
Tomas Mőller © 2000 Speeding up your game The scene graph Culling techniques Level-of-detail rendering (LODs) Collision detection Resources and pointers.
© Anselm Spoerri Lecture 8 Topic Assignment Information Visualization – Origins Information Visualizer Visualization of Hierarchical Data.
Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures Brian Johnson Ben Shneiderman (HCIL TR 91-06) Steve Betten.
1 SIMS 247: Information Visualization and Presentation jeffrey heer Tree Visualization Oct 26, 2005.
Browsing Hierarchical Data with Multi-level Dynamic Queries and Pruning By H. P. Kumar, C. Plaisant & B. Schneidernam Presented by: Dawit Yimam Seid.
Cone Trees and Collapsible Cylindrical Trees
Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies. By Bederson, B.B., Shneiderman, B., and Wattenberg, M. ACM Transactions.
14.1 Vis_04 Data Visualization Lecture 14 Information Visualization : Part 2.
Tree-Maps Cyntrica Eaton February 11, 2001 A Space-Filling Approach to the Visualization of Hierarchical Information Structures Brian Johnson Ben Shneiderman.
Hyperbolic Brower  Focus+Context browsing of large hierarchies  Inspired by Escher  Intuitive Nodes in center are more important, and therefore larger.
Musings on Treemaps John Stasko Information Interfaces Research Group College of Computing / GVU Center Georgia Institute of Technology HCIL, Univ. of.
SpaceTree An Interactive Visualization of Traditional Node-Link Tree Diagrams Jesse Grosjean Catherine Plaisant Ben Bederson Human-Computer Interaction.
Ordered and Quantum Treemaps: Making effective use of 2D space to display hierarchies B. Bederson, B. Shneiderman, M. Wattenberg ACM Trans. On Graphics.
SpaceTree: Supporting Exploration in Large Node Link Tree, Design Evolution and Empirical Evaluation Catherine Plaisant, Jesse Grosjean, Benjamin B.Bederson.
Introduction to 3D Graphics John E. Laird. Basic Issues u Given a internal model of a 3D world, with textures and light sources how do you project it.
Tree Structures (Hierarchical Information) cs5764: Information Visualization Chris North.
Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures Presented by: Daniel Loewus-Deitch.
Oct 7, 2013 IAT Trees2 Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE.
CHAPTER 11 Tables. How Are Tables Used Data Display  Very tidy and very useful Better Text Alignment  Putting text in tables allows you to format indents.
H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space Tamara Munzner Stanford University 元智資工所 系統實驗室 楊錫謦 1999/11/3.
Graphs, Networks, Trees. Examples for in class Visual Web ▫ Website as graphs ( Website as graphs.
By LaBRI – INRIA Information Visualization Team. Tulip 2010 – version Tulip is an information visualization framework dedicated to the analysis.
Information Design and Visualization
Visualization Taxonomies and Techniques Trees and Graphs
Elements and Principles of Graphic Design Communications Technology 11.
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Designing the User Interface: Strategies for Effective Human-Computer.
Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris.
Graphs, Networks, Trees. Examples for in class Visual Web ▫ Website as graphs Website as graphs  See Brad’s
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Designing the User Interface: Strategies for Effective Human-Computer.
A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies. John Lamping, Ramana Rao, and Peter Pirolli Xerox Palo Alto Research.
Information Visualization –III Treemaps and Fisheye Views.
IAT 814 Trees Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS +
Glyph Visualization and Yet Another Tree Visualization Matt Williams InfoVis 533c April 3, 2003.
Interacting with Huge Hierarchies: Beyond Cone Trees Jeromy Carriere, Rick Kazman Computer Graphics Lab, Department of Computer Science University of Waterloo,
Interactive Information Visualization of a Million Items
IAT Overview + Detail Focus + Context ______________________________________________________________________________________ SCHOOL OF INTERACTIVE.
Feature-Based Parametric Modeling
Fall 2002CS/PSY Information Visualization 2 Case Study: Portraying Hierarchies Visualizing hierarchies  Variety of techniques Traditional tree views,
Graph Visualization and Beyond … Anne Denton, April 4, 2003 Including material from a paper by Ivan Herman, Guy Melançon, and M. Scott Marshall.
Mao Lin Huang University of Technology, Sydney, Visual Representations of Data and Knowledge.
Hyperbolic Trees A Focus + Context Technique John lamping Ramana Rao Peter Pirolli Joy Mukherjee.
Innovative UI Ideas Marti Hearst SIMS 213, UI Design & Development April 20, 1999.
Cours de Visualisation d'Information InfoVis Lecture Hierarchies and Trees 1 Frédéric Vernier Enseignant-Chercheur LIMSI-CNRS Maître de conf Paris XI Inspired.
Information Visualiation: Trees Chris North cs3724: HCI.
Data Visualization Fall Information Visualization Fall 2015Data Visualization2 Upon now, we dealt with scientific visualization (scivis) Scivis.
John Lamping, Ramana Rao, Peter Porolli
Guilford County SciVis V104.01
Comp 15 - Usability & Human Factors Unit 12b - Information Visualization This material was developed by Columbia University, funded by the Department of.
3D Ojbects: Transformations and Modeling. Matrix Operations Matrices have dimensions: Vectors can be thought of as matrices: v=[2,3,4,1] is a 1x4 matrix.
IAT 355 Trees2 ______________________________________________________________________________________.
cs5984: Information Visualization Chris North
Hierarchies (Trees) Definition Examples
Usability & Human Factors
cs5984: Information Visualization Chris North
Information Design and Visualization
Information Visualization 2 Case Study: Portraying Hierarchies
Presentation transcript:

Nov 26, 2009 IAT Visualizing Trees ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS + TECHNOLOGY [SIAT] |

Nov 26, 2009 IAT Hierarchies Definition –Data repository in which cases are related to subcases –Can be thought of as imposing an ordering in which cases are parents or ancestors of other cases

Nov 26, 2009 IAT Hierarchies in the World Examples –Family histories, ancestries –File/directory systems on computers –Organization charts –Animal kingdom: Phylum,…, genus,…

Nov 26, 2009 IAT Trees Hierarchies often represented as trees –Directed, acyclic graph Two main representation schemes –Node-link –Space-filling

Nov 26, 2009 IAT Task Learn the structure of the hierarchy Example Structure questions –Who has the most descendants? –What family tends to have the most children? Example Search question –Who is Bob’s paternal grandfather?

Nov 26, 2009 IAT Node-Link Diagrams Root at top, leaves at bottom is very common

Nov 26, 2009 IAT Sample Representation From Johnson &Shneiderman 1991

Nov 26, 2009 IAT Example Layout –Tree level indicated by X  –Unique item per Y slot –Takes advantage of reading order Good for? –Search Bad for? –Understanding Structure –1 folder per row pushes large structures away

Nov 26, 2009 IAT Why Put Root at Top? Root can be at center with levels growing outward too Can any node be the root?

Nov 26, 2009 IAT Drawing a Tree Show more structure by allocating space differently –1 horizontal slice per level –How wide should it be?

Nov 26, 2009 IAT Drawing a Tree How to draw this? –Depth-First Search –Propagate size requirements upward from leaves

Nov 26, 2009 IAT Potential Problems For top-down, width of fan-out uses up horizontal real estate very quickly –At level n, there are 2n nodes Tree might grow a lot along one particular branch –Hard to draw it well in view without knowing how it will branch

Nov 26, 2009 IAT InfoVis Solutions Techniques developed in Information Visualization largely try to assist the problems identified in the last slide Alternatively, Information Visualization techniques attempt to show more attributes of data cases in hierarchy or focus on particular applications of trees

Nov 26, 2009 IAT SpaceTree Uses conventional 2D layout techniques What are its unique features? –Grosjean, Plaisant, Bederson InfoVis ‘02

Nov 26, 2009 IAT SpaceTree Characteristics Vertical or horizontal Subtrees are triangles –Size indicates depth –Shading indicates number of nodes inside Navigate by clicking on nodes –Strongly restrict zooming

Nov 26, 2009 IAT SpaceTree Design Features Make labels readable Maximize number of levels opened Decompose tree animation Use landmarks Use overview and dynamic filtering

Nov 26, 2009 IAT D Approaches Add a third dimension into which layout can go Compromise of top-down and centered techniques mentioned earlier Children of a node are laid out in a cylinder “below” the parent –Siblings live in one of the 2D planes

Nov 26, 2009 IAT ConeTree Interactive tree viewer Clicking on node rotates it to front Occlusion makes stuff hard to pick

Nov 26, 2009 IAT Alternative View

Nov 26, 2009 IAT Cone Trees Positive –More effective area (volume) to lay out tree –Use of smooth animation to help person track updates –Aesthetically pleasing Negative –Occlusion obscures some nodes –Requires some graphics horsepower

Nov 26, 2009 IAT Alternative Solutions Change the geometry Apply a hyperbolic transformation to the space Root is at center, subordinates around Apply idea recursively, distance decreases between parent and child as you move farther from center, children go in wedge rather than circle

Nov 26, 2009 IAT Hyperbolic Browser Focus + Context Technique –Detailed view blended with a global view First lay out the hierarchy on the hyperbolic plane Then map this plane to a disk Start with the tree’s root at the center Use animation to navigate along this representation of the plane

Nov 26, 2009 IAT D Hyperbolic Browser Approach: Lay out the hierarchy on the hyperbolic plane and map this plane onto a display region. Comparison –A standard 2D browser: 100 nodes (w/3 character text strings) –Hyperbolic browser: 1000 nodes, about 50 nearest the focus can show from 3 to dozens of characters YouTube User “Treerao”

Nov 26, 2009 IAT Hyperbolic Key Attributes Natural magnification (fisheye) in center –Layout depends only on 2-3 generations from current node –Smooth animation for change in focus –Don’t draw objects when far enough from root (simplify rendering) Problems –Watching the view can be disorienting –When a node is moved, its children don’t keep their relative orientation to it as in Euclidean plane, they rotate –Not as symmetric and regular as Euclidean techniques Makes visual search more difficult

Nov 26, 2009 IAT Node-link Shortcoming Difficult to encode more variables of data cases (nodes) –Shape –Color –Size –…but all quickly clash with basic node-link structure

Nov 26, 2009 IAT Space-Filling Representation Each item occupies an area Children are “contained” under parent –Example shows each horizontal slice corresponding to a tree level –Width of box displays node size

Nov 26, 2009 IAT Treemap Space-filling representation developed by Shneiderman and Johnson, Vis ‘91 Children are drawn inside their parent Alternate horizontal and vertical slicing at each successive level Use area to encode other variable of data items

Nov 26, 2009 IAT Treemap Example Folders

Nov 26, 2009 IAT TreeMap Demo

Nov 26, 2009 IAT Treemap Algorithm Draw() { Change orientation from parent (horiz/vert) Read all files and directories at this level Make rectangle for each, scaled to size Draw rectangles using appropriate size and color For each directory Make recursive call using its rectangle as focus }

Nov 26, 2009 IAT Nested vs. Non-nested Non-nested Nested

Nov 26, 2009 IAT Applications Can use Treemap idea for a variety of domains –File/directory structures –Basketball statistics –Software diagrams Useful where there is a size query

Nov 26, 2009 IAT Internet News Groups NetScan

Nov 26, 2009 IAT Treemap Affordances Good representation of two attributes beyond node-link: color and area Not as good at representing structure –What happens if it’s a perfectly balanced tree of items all the same size? –Also can get long-thin aspect ratios –Borders help on smaller trees, but take up too much area on large, deep ones

Nov 26, 2009 IAT Aspect ratios Long thin rectangles hard to use Hard to estimate area Which one is bigger?

Nov 26, 2009 IAT More squareness! Can we force a rectangle to be “more square”? Problem is that other rectangles have to change shape NP Hard problem (Optimization, bin packing..)

Nov 26, 2009 IAT Variation: “Cluster” Treemap SmartMoney.com Map of the Market –Illustrates stock movements –“Compromises” treemap algorithm to avoid bad aspect ratios –Basic algorithm (divide and conquer) with some hand tweaking –Takes advantage of shallow hierarchy –

Nov 26, 2009 IAT

Nov 26, 2009 IAT SmartMoney Review Dynamic user interface operations add to impact

Nov 26, 2009 IAT Square Algorithm Problems Small changes in data values can cause dramatic changes in layout Order of items in a group may be important

Nov 26, 2009 IAT Showing Structure Regular borderless treemap makes it challenging to discern structure of hierarchy, particularly large ones –Supplement Treemap view –Change rectangles to other forms

Nov 26, 2009 IAT Variation: Cushion Treemap Add shading and texture to convey structure of hierarchy

Nov 26, 2009 IAT SequoiaView File visualizer using cushion treemap

Nov 26, 2009 IAT News Stories

Nov 26, 2009 IAT Another Problem What if nodes with zero value (mapped to area) are very important? –Example: Stock or mutual fund portfolios: Funds you don’t currently hold have zero value in your portfolio, but you want to see them to potentially buy them

Nov 26, 2009 IAT FundExplorer Show mutual fund portfolios, including funds not currently held –Area maps to your relative investment in fund Want to help the user with portfolio diversification as well –If I add fund X, how does that overlap with my current fund holdings?

Nov 26, 2009 IAT Solution Context Treemap – Treemap with small distortion –Give zero-valued items (all together) some constant proportion of screen area –Provide dynamic query capabilities to enhance exploration leading to portfolio diversification

Nov 26, 2009 IAT FundExplorer

Nov 26, 2009 IAT What about Radial Space filling? What if we used a radial rather than a rectangular space-filling technique? –We saw node-link trees with root in center and growing outward already... Make pie-tree with root in center and children growing outward –Radial angle now corresponds to a variables rather than area

Nov 26, 2009 IAT SunBurst Stasko et al 2000

Nov 26, 2009 IAT SunBurst Root directory at center, each successive level drawn farther out from center Sweep angle of item corresponds to size Color maps to file type or age Interactive controls for moving deeper in hierarchy, changing the root, etc. Double-click on directory makes it new root

Nov 26, 2009 IAT Zoomology Not quite space filling –Circles within circles –Alternative structure view Highly Interactive

Nov 26, 2009 IAT Zoomology Coordinated structure views

Nov 26, 2009 IAT Space-Filling Representation Good for trees with –Size attribute –Shallow hierarchy Not so good –Showing structure –Showing links other than parent-child –Supporting visual search for a single item