The Hierarchical Degree-of-Visibility Tree

Authors:
Lidan Shou;Zhiyong Huang;Kian-Lee Tan
Affiliations:
-;IEEE;IEEE Computer Society
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2004

Citing 6
Cited 3

Visibility preprocessing for interactive walkthroughs

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Management of large amounts of data in interactive building walkthroughs

I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
MMR: an interactive massive model rendering system using geometric and image-based acceleration

I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Walking Through a Very Large Virtual Environment in Real-time

Proceedings of the 27th International Conference on Very Large Data Bases
Hierarchical Visibility Culling with Occlusion Trees

CGI '98 Proceedings of the Computer Graphics International 1998

Formalizing visibility characteristics in hierarchical systems

Data & Knowledge Engineering
Sense the physical, walkthrough the virtual, manage the co (existing) spaces: a database perspective

ACM SIGMOD Record
Preprocessed global visibility for real-time rendering on low-end hardware

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.