H3:3D Hyperbolic Graphs

1
H33D Hyperbolic Graphs

• Presenter Dhananjay Mishra
• Discusser Savyasachi Samal

2
Assumptions

• Everyone in this class was present on oct 16th
  class when cone trees(Anuj) and hyperbolic
  trees(David) were discussed
• Everyone one still remembers nice (?)
• pictures/graphs

3
Quick Recap

• Hyperbolic Trees Cone Trees

4
Data

• Large directed Graphs with hierarchy imposed on it

5

6
Method
Large Directed Graph
Step1 Appropriate Spanning Tree
Step 2 Layout in 3D Hyperbolic space
7
Step 1

• Uses domain specific knowledge to impose
  hierarchy
• examples-
• Unix directory system
• Hyperlink structure of the web
• URL encodes the place of a Web document in the
  Unix directory structure

8
Step 2

• Uses cone tree approach with a little
  modification in hyperbolic space
• Modification
• Uses surface of hemispherical cap covering the
  mouth of cone in place of
• Perimeter of the circle(in cone-tree method)
  to lay out children nodes

9
Packing of nodes on hemisphere
10
How does it look like finally??
11
http//graphics.stanford.edu/papers/h3/movie/slash
.mov
12
Pros- Cons-

• Includes almost all good features of both
  cone-tree and hyperbolic-tree
• Large scalability
• Non-tree links on demand
• Efficient use of space
• Nice global overview
• Minimum visual clutter

• No standard method to get spanning tree
• Packing on hemisphere looses space

13
HCI Metrics-
Hand over to Samal

• User performance
• Learning time
• Error rate
• Retention time
• User satisfaction