Please use this identifier to cite or link to this item:
|Title:||The hierarchical degree-of-visibility tree|
|Keywords:||Degree of visibility|
Performance and visual fidelity
|Citation:||Shou, L., Huang, Z., 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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 11, 2018
WEB OF SCIENCETM
checked on Jun 25, 2018
checked on Jul 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.