140 likes | 231 Views
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
E N D
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 • 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.
RDT • some definitions • outer-radius • center point(cp) • reference point(rp) • apex point(ap) • apex height(ah) • reference height(rh) • reference length(rl)
RDT(cont.) • RDT can transform its shape into various forms by changing the attributes rl, ah, and rh.
RDT(cont.) • 3D RDT Layout Inner_sum > 2π*max_child_radius Inner_sum < 2π*max_child_radius
RDT(cont.) • 2D RDT Layout Inner_sum > 4π*max_child_radius Inner_sum < 4π*max_child_radius
Evaluation • Percentage of Occlusion(Disk Tree)
Evaluation(cont.) • Density of Displayed Nodes(Compact Disk Tree)
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