Ordered and Quantum Treemaps: Making effective use of 2D space to display hierarchies B. Bederson, B. Shneiderman, M. Wattenberg ACM Trans. On Graphics.

Slides:



Advertisements
Similar presentations
The Web Wizards Guide to HTML Chapter Six Tables.
Advertisements

Equality Join R X R.A=S.B S : : Relation R M PagesN Pages Relation S Pr records per page Ps records per page.
Knapsack Problem Section 7.6. Problem Suppose we have n items U={u 1,..u n }, that we would like to insert into a knapsack of size C. Each item u i has.
Word Spotting DTW.
Fast Algorithms For Hierarchical Range Histogram Constructions
Heaps1 Part-D2 Heaps Heaps2 Recall Priority Queue ADT (§ 7.1.3) A priority queue stores a collection of entries Each entry is a pair (key, value)
Trees and Cushions Jack van Wijk Eindhoven University of Technology Treemap Workshop, May 31, 2001 HCIL, University of Maryland.
Jun 2, 2014 IAT Trees2 Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE.
Object Recognition & Model Based Tracking © Danica Kragic Tracking system.
Introduction to Algorithms Chapter 7: Quick Sort.
1 Sorting Problem: Given a sequence of elements, find a permutation such that the resulting sequence is sorted in some order. We have already seen: –Insertion.
Microsoft ® Research Faculty Summit 2002 Building Scalable User Interfaces for Mobile Devices using.NET Technologies Benjamin B. Bederson Computer Science.
Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures Brian Johnson Ben Shneiderman (HCIL TR 91-06) Steve Betten.
MSU CSE 240 Fall 2003 Stockman CV: 3D to 2D mathematics Perspective transformation; camera calibration; stereo computation; and more.
More on Decision Trees. Numerical attributes Tests in nodes can be of the form x j > constant Divides the space into rectangles.
Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies. By Bederson, B.B., Shneiderman, B., and Wattenberg, M. ACM Transactions.
Spatial Indexing I Point Access Methods.
Graphics Output Primitives Pixel Addressing and Fill Area Dr. M. Al-Mulhem Feb. 1, 2008.
Treemap Implementation and Application Workshop Ben Shneiderman Human-Computer Interaction Laboratory University of Maryland Marc Frons Smartmoney.
Approximation Algorithms for MAX-MIN tiling Authors Piotr Berman, Bhaskar DasGupta, S. Muthukrishman S. Muthukrishman Published on Journal of Algorithms,
The University of Adelaide Table Talk: Using tables in Word Peter Murdoch March 2014 PREPARING GOOD LOOKING DOCUMENTS.
Tree Structures (Hierarchical Information) cs5764: Information Visualization Chris North.
Pasewark & Pasewark 1 Word Lesson 6 Working with Graphics Microsoft Office 2007: Introductory.
Computer Algorithms Lecture 11 Sorting in Linear Time Ch. 8
Microsoft Office 2007: Introductory 1 Word Lesson 6 Working with Graphics Computer Applications 1.
Oct 7, 2013 IAT Trees2 Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE.
Section 11.4 Language Classes Based On Randomization
Tag-Cloud Drawing: Algorithm for Cloud Visualization
 Optimal Packing of High- Precision Rectangles By Eric Huang & Richard E. Korf 25 th AAAI Conference, 2011 Florida Institute of Technology CSE 5694 Robotics.
Visual Analysis of Hierarchical Management Data Zhao Geng 1, Gaurav Gathania 2, Robert S.Laramee 1 and ZhenMin Peng 1 1 Visual Computing Group, Computer.
Recursion and Dynamic Programming. Recursive thinking… Recursion is a method where the solution to a problem depends on solutions to smaller instances.
Information Visualization –III Treemaps and Fisheye Views.
IAT 814 Trees Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS +
B-trees and kd-trees Piotr Indyk (slides partially by Lars Arge from Duke U)
Metro Transit-Centric Visualization for City Tour Planning Pio Claudio and Sung-Eui Yoon.
Interactive Information Visualization of a Million Items
Html Tables Basic Table Markup. How Tables are Used For Data Display Tables were originally designed to display and organize tabular data (charts, statistics,
Application Paradigms: Unstructured Grids CS433 Spring 2001 Laxmikant Kale.
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall. 1 Skills for Success with Microsoft ® Office 2007 PowerPoint Lecture to Accompany.
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
Fall 2002CS/PSY Information Visualization 2 Case Study: Portraying Hierarchies Visualizing hierarchies  Variety of techniques Traditional tree views,
Mao Lin Huang University of Technology, Sydney, Visual Representations of Data and Knowledge.
Digital imaging By : Alanoud Al Saleh. History: It started in 1960 by the National Aeronautics and Space Administration (NASA). The technology of digital.
Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.
Digital imaging By : Alanoud Al Saleh. History: It started in 1960 by the National Aeronautics and Space Administration (NASA). The technology of digital.
R-Trees: A Dynamic Index Structure For Spatial Searching Antonin Guttman.
Week 10 - Friday.  What did we talk about last time?  Graph representations  Adjacency matrix  Adjacency lists  Depth first search.
Computer Sciences Department1.  Property 1: each node can have up to two successor nodes (children)  The predecessor node of a node is called its.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2015.
CSE554Contouring IISlide 1 CSE 554 Lecture 3: Contouring II Fall 2011.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
1 Ch.19 Divide and Conquer. 2 BIRD’S-EYE VIEW Divide and conquer algorithms Decompose a problem instance into several smaller independent instances May.
Positioning Objects with CSS and Tables
Microsoft® Access Generate forms quickly 1 Modify controls in Layout View 2 Work with form sections 3 Modify controls in Design View 4 Add calculated.
Introduction to Programming the WWW I CMSC Winter 2003 Lecture 5.
VISUAL C++ PROGRAMMING: CONCEPTS AND PROJECTS Chapter 7A Arrays (Concepts)
Multidimensional Access Structures COMP3017 Advanced Databases Dr Nicholas Gibbins –
Advanced Sorting 7 2  9 4   2   4   7
CSE 554 Lecture 5: Contouring (faster)
Indexing and hashing.
Multidimensional Access Structures
IAT 355 Trees2 ______________________________________________________________________________________.
Priority Queues © 2010 Goodrich, Tamassia Priority Queues 1
Basic Principles of Layout
Heaps © 2010 Goodrich, Tamassia Heaps Heaps
cs5984: Information Visualization Chris North
cs5984: Information Visualization Chris North
Ch. 8 Priority Queues And Heaps
Information Visualization 2 Case Study: Portraying Hierarchies
Data Transformations targeted at minimizing experimental variance
Presentation transcript:

Ordered and Quantum Treemaps: Making effective use of 2D space to display hierarchies B. Bederson, B. Shneiderman, M. Wattenberg ACM Trans. On Graphics Oct 2002 Presented by: Neeti Ogale and Rachael Bradley

Treemaps Space filling technique to visualize hierarchical data Space filling technique to visualize hierarchical data

Issues of concern for treemaps Minimize the aspect ratio of the rectangles Minimize the aspect ratio of the rectangles Maintain Order in the data Maintain Order in the data Accommodate changes in the data Accommodate changes in the data

Original algorithm for Treemaps Slice and Dice Treemap : (Shneiderman, B. 1992). Preserves order Preserves order Changes to the data cause continuous changes in the output Changes to the data cause continuous changes in the output Aspect ratio of rectangles can be large – so can give long skinny rectangles Aspect ratio of rectangles can be large – so can give long skinny rectangles Slice and Dice Gray shades : Order

Treemaps by the other two algorithms Cluster Treemap ( Cluster Treemap ( Wattenberg, M. 99’ ) Squarified Treemap ( Squarified Treemap (Wijk et al. 2000) Overall aspect ratio is less – no skinny long rectangles Overall aspect ratio is less – no skinny long rectangles Changes to the data cause dramatic discontinuous changes Changes to the data cause dramatic discontinuous changes Does not maintain order Does not maintain order Cluster Treemap Squarified Treemap

Demo

Ordered treemap algorithm Inputs: Rectangle R and ordered list of items having specific areas Inputs: Rectangle R and ordered list of items having specific areas Recursive algorithm. At each step: Recursive algorithm. At each step: Select a pivot item (P) Select a pivot item (P) Divide the list into 3 parts L1,L2 and L3 and R into four rectangles, R1, RP,R2, and R3 If the number of items is <= 4, lay them out in either a pivot, quad, or snake layout, Stop If width > = height

Selection of Pivot

Dividing the list L Divide the items in the list, other than P, into three lists, L1, L2, and L3, such that L1 consist of items whose index is less than P and L2 have items having index less than those in L3, and the aspect ratio of RP is as close to 1 as possible

Stopping condition PivotQuad Snake If number of items is <= 4, lay them either in a pivot, quad, or snake layout Pick the layout whose average aspect ratio is closest to 1.

Strip treemap algorithm Rectangles are processed in order and inserted in the current strip if doing so does not increase the average aspect ratio of all the rectangles in the strip ( Rectangles are processed in order and inserted in the current strip if doing so does not increase the average aspect ratio of all the rectangles in the strip (O(sqrt(n)) time on average)

Quantum Treemaps To display items of fixed size – Images. To display items of fixed size – Images.

Quantum tree maps algorithm Rectangles are quantized when they are generated in the following manner – Rectangles are quantized when they are generated in the following manner – Dimensions are integer multiple of the given element size. Dimensions are integer multiple of the given element size. Total area is at least equal to the total area of all the elements to be fitted in it. Total area is at least equal to the total area of all the elements to be fitted in it. Grids of elements are aligned with rows and columns of elements running across the entire series of rectangles. Grids of elements are aligned with rows and columns of elements running across the entire series of rectangles.

Demo

Experimental Results A tradeoff between low aspect ratios and smooth updates. The slice-and-dice method - high aspect ratios, but small changes with data updates. Squarified and Cluster treemaps - low aspect ratios and large changes in layouts. The ordered and strip treemaps fall in the middle of the spectrum. Aspect ratios better than slice- and-dice method, update more smoothly than cluster or squarified treemaps 100 Monte Carlo trials with 100 steps -simulate continuously changing data. changing data.

Readability study Readability: ease of visually scanning a layout Static stock market data.

Quantum Treemap Analysis: Aspect Ratios

Quantum Treemap Analysis: Space

Future Work Improve the overall aspect ratio and Improve the overall aspect ratio and optimize the algorithms used by cluster treemaps and squarified treemaps to improve stability under dynamic updates. Mixing different algorithms to combine their strengths Look for a mathematical theorem that makes the tradeoff between the aspect ratio and smoothness of layout changes precise. Accommodation of trees with millions of nodes Accommodation of trees with millions of nodes Show more than two attribute values for each leaf node