1 / 14

Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space Chang-Sung Jeong

Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space Chang-Sung Jeong Alex Pang Information Visualization, 1998. Proceedings. IEEE Symposium on , 1998 元智資工所 系統實驗室 楊錫謦 2000/3/6. Outline Introduction RDT Evaluation Conclusion. Introduction

taylor-buckner
Download Presentation

Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space Chang-Sung Jeong

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. Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space Chang-Sung Jeong Alex Pang Information Visualization, 1998.Proceedings. IEEE Symposium on , 1998 元智資工所 系統實驗室楊錫謦 2000/3/6

  2. Outline • Introduction • RDT • Evaluation • Conclusion

  3. Introduction • There are some 3D visualization techniques used to visualize hierarchical structures. • Cone Tree is one of those 3D visualization techniques. • parts of the cone tree may not be visible • tend to produce visual clutter with more than 1000 nodes • The RDT can alleviate the disadvantages of cone trees for large hierarchies.

  4. RDT • some definitions • outer-radius • center point(cp) • reference point(rp) • apex point(ap) • apex height(ah) • reference height(rh) • reference length(rl)

  5. RDT(cont.) • RDT can transform its shape into various forms by changing the attributes rl, ah, and rh.

  6. RDT(cont.)

  7. RDT(cont.)

  8. RDT(cont.) • 3D RDT Layout Inner_sum > 2π*max_child_radius Inner_sum < 2π*max_child_radius

  9. RDT(cont.) • 2D RDT Layout Inner_sum > 4π*max_child_radius Inner_sum < 4π*max_child_radius

  10. RDT(cont.)

  11. Evaluation • Percentage of Occlusion(Disk Tree)

  12. Evaluation(cont.) • Density of Displayed Nodes(Compact Disk Tree)

  13. Evaluation(cont.)

  14. Conclusion • RDT can enhance user perception by transforming its shapes dynamically. • disc tree – reduce the occluded region • compact tree – increase the number of nodes displayed • plane disc tree – can be mapped onto to plane withoutvisual overlapping

More Related