The hierarchical degree-of-visibility tree

Please use this identifier to cite or link to this item: https://doi.org/10.1109/TKDE.2004.78

Title:	The hierarchical degree-of-visibility tree
Authors:	Shou, L. HUANG ZHIYONG Tan, K.-L.
Keywords:	Degree of visibility HDoV-tree Level-of-details Performance and visual fidelity Virtual environment
Issue Date:	2004
Citation:	Shou, L., HUANG ZHIYONG, Tan, K.-L. (2004). The hierarchical degree-of-visibility tree. IEEE Transactions on Knowledge and Data Engineering 16 (11) : 1357-1369. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2004.78
Abstract:	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.
Source Title:	IEEE Transactions on Knowledge and Data Engineering
URI:	http://scholarbank.nus.edu.sg/handle/10635/39110
ISSN:	10414347
DOI:	10.1109/TKDE.2004.78
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check