Issue No.11 - November (2004 vol.16)
Zhiyong Huang , IEEE
Kian-Lee Tan , IEEE Computer Society
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.78
In this paper, we present a novel structure called the Hierarchical Degree-of-Visibility Tree (HDoV-tree) for visibility query processing in visualization systems. The HDoV-tree builds on and extends the R-tree such that 1) the search space is pruned based on the degree of visibility of objects and 2) internal nodes store level-of-details (LoDs) that represent a collection of objects in a coarser form. We propose two tree traversal algorithms that balance performance and visual fidelity, explore three storage structures for the HDoV-tree, and develop novel caching techniques for disk-based HDoV-tree. We implemented the HDoV-tree in a prototype walkthrough system called VISUAL. Our experimental study shows that VISUAL can lead to high frame rates without compromising visual fidelity.
Degree of visibility, HDoV-tree, level-of-details, performance and visual fidelity, virtual environment.
Lidan Shou, Zhiyong Huang, Kian-Lee Tan, "The Hierarchical Degree-of-Visibility Tree", IEEE Transactions on Knowledge & Data Engineering, vol.16, no. 11, pp. 1357-1369, November 2004, doi:10.1109/TKDE.2004.78