Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/27648
Title: | Querying large virtual models for interactive walkthrough | Authors: | SHOU LIDAN | Keywords: | Data Structure, Spatial Index, Visibility, Real-time Walkthrough, Storage, Caching | Issue Date: | 12-Nov-2003 | Citation: | SHOU LIDAN (2003-11-12). Querying large virtual models for interactive walkthrough. ScholarBank@NUS Repository. | Abstract: | This thesis addresses database issues for real-time walkthrough of large Virtual Environments. The main purpose of the research is to design novel techniques to facilitate storing, manipulating, and retrieving of dataon secondary storage, and to provide optimization support for real-time rendering.We propose novel algorithms, such as caching, prefetching, and Complement Searching, based on spatial index and design the REVIEWwalkthrough system, which implements these spatial techniques. We also propose a novel disk data structure called Hierarchical Degree-of-Visibility (HDoV) tree, and several algorithms based on the tree structure. We also test the performance of the memory version of the HDoV-tree structure. These visibility techniques are implemented in the VISUAL system. We conduct extensive performance experiments on these two systems. | URI: | http://scholarbank.nus.edu.sg/handle/10635/27648 |
Appears in Collections: | Ph.D Theses (Open) |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
dissert.pdf | 1.74 MB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.