Please use this identifier to cite or link to this item:
|Title:||HDoV-tree: The structure, the storage, the speed|
|Citation:||Shou, L., Huang, Z., Tan, K.-L. (2003). HDoV-tree: The structure, the storage, the speed. Proceedings - International Conference on Data Engineering : 557-568. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2003.1260821|
|Abstract:||In a visualization system, one of the key issues is to optimize performance and visual fidelity. This is especially critical for large virtual environments where the models do not fit into the memory. In this paper, we present a novel structure called HDoV-tree that can be tuned to provide excellent visual fidelity and performance based on the degree of visibility of objects. HDoV-tree also exploits internal level-of-details (LoDs) that represent a collection of objects in a coarser form. We also propose three storage structures for the HDoV-tree. We implemented HDoV-tree in a prototype walkthrough system called VISUAL. We have evaluated the HDoV-tree on visibility queries, and also compared the performance of VISUAL against REVIEW, a walkthrough system based on R-tree. Our results show that the HDoV-tree is an efficient structure. Moreover, VISUAL can lead to high frame rates without compromising visual fidelity.|
|Source Title:||Proceedings - International Conference on 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 21, 2018
WEB OF SCIENCETM
checked on Jun 6, 2018
checked on Jul 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.