1 / 43

Lecture 19: Visualizing Hierarchies II

Lecture 19: Visualizing Hierarchies II. April 18, 2013 COMP 150-2 Visualization. Admin. Norman’s new data set Using a “literal” visualization Thought exercise – how to scale?. Types of Hierarchy Visualizations. Space Filling Node-Link. Node-Link Structures.

murray
Download Presentation

Lecture 19: Visualizing Hierarchies II

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 19:Visualizing Hierarchies II April 18, 2013 COMP 150-2Visualization

  2. Admin Norman’s new data set Using a “literal” visualization Thought exercise – how to scale?

  3. Types of Hierarchy Visualizations • Space Filling • Node-Link

  4. Node-Link Structures • Usually represented as a graph (or a tree) • Directed • Acyclic • Ordering (top-bottom / left-right / inside-out) represent ancestral relationships

  5. Common Node-Link Diagrams • Top-Down ordering, root node on top, leaf nodes at the bottom.

  6. Common Node-Link Diagrams • Left-Right ordering (?). • Indented – root node to the left, leaf nodes to the right.

  7. Common Node-Link Diagrams • Inside-Out Ordering. • Root node in the center, leaf nodes to the outside.

  8. Problems with Trees… • In top-down designs, the horizontal screen real estate becomes scarce quickly. • Assume a balanced binary tree, at level n, there are 2n nodes. • Trees are not guaranteed to be balanced. One branch can be much deeper than others, causing vertical real estate usages to become disproportional.

  9. Questions?

  10. How to Draw This Tree? • How wide does this graph have to be?

  11. Icicle Plot

  12. Visualization Techniques • Techniques developed in Information Visualization largely try to assist the problems identified in the last slide • In addition, Information Visualization techniques attempt to show more information about the tree (or each node), and leverages domain-specific knowledge to draw the trees.

  13. SpaceTree Grosjean, Plaisant, BedersonInfoVis „02

  14. Characteristics • Subtrees are triangles • Size indicates depth • Shading indicates size of sub-tree • Allows for interactive navigation • http://www.cs.umd.edu/hcil/spacetree/applet/applet.shtml

  15. Cone Trees • Top-Down Ordering

  16. Cone Trees • Left-Right Ordering

  17. Pros and Cons? • Pros: • Animation • More space for layout • Cons • All in 3D, occlusion is a problem

  18. Hyperbolic Trees • Focus + Context Technique • Detailed view blended with global view • Lays out the hierarchy on a hyperbolic plane, and then mapped to a disk • Inside-outside ordering

  19. 2D Hyperbolic Browser http://flare.prefuse.org/demo

  20. Animation in Hyperbolic Tree

  21. Key Attributes • Fisheye Lens in the center • Displays approximately 3 levels from current node • Smooth animation • Simplifies rendering for far-away nodes

  22. Pros and Cons • Pros • Natural magnification • Can display large number of nodes • Cons • Disorienting… • Can’t see the whole picture

  23. H3Viewer

  24. H3Viewer • Drawing: • Maintains a target frame by showing less of the context • Fills in details when the user is idle

  25. Questions?

  26. Degree-of-Interest Trees • Problem: • Too many leaf nodes – turns into a line • Solution • Use focus+context (distortion) to control how a tree is drawn

  27. Approach • Degree-of-Interest computation • Geometric scaling • Semantic scaling • Clustered representation • Logical filtering

  28. Degree-of-Interest Trees

  29. Compression • Layout Compression • Node Compression

  30. Organization Chart

  31. FlexTree • Left-Right ordering with vertical compression • Idea: push the nodes as far down as possible

  32. Doubles as a Bar Chart

  33. Node Details

  34. Space-Optimized Tree • Approach: utilize Voronoi diagram

  35. Viewing and Navigation

  36. Other Space-Filling + Node-Link Graphs • RINGS (2002)

  37. Other Space-Filling + Node-Link Graphs • H-Tree

  38. Other Space-Filling + Node-Link Graphs • Hilbert Curves

  39. Other Space-Filling + Node-Link Graphs • Point-Based Tree Representation

  40. Other Space-Filling + Node-Link Graphs • Polygon-Bounded Trees

  41. Other Space-Filling + Node-Link Graphs • PhylloTrees • http://innovis.cpsc.ucalgary.ca/Research/PhylloTrees

  42. Questions?

  43. Exercise ? • Considering that all the visualizations depict the same data and relationships, how can one go from one visualization to another?

More Related