Please use this identifier to cite or link to this item:
|Title:||Preprocessing occlusion for real-time selective refinement|
|Citation:||Law, Fei-Ah,Tan, Tiow-Seng (1999). Preprocessing occlusion for real-time selective refinement. Proceedings of the Symposium on Interactive 3D Graphics : 47-53. ScholarBank@NUS Repository.|
|Abstract:||Visibility computation and level of detail modeling are two important components of efficient scene rendering algorithms. Both aim to lessen the graphics load by lowering polygon count. This paper presents a novel framework that integrates the two techniques to optimize rendering. To improve the efficiency of occlusion computation for densely tessellated models, we introduce the use of simplification to automatically deduce virtual occluders. This paper illustrates the use of the technique to efficiently preprocess occlusion for outdoor scenes. Using virtual occluders to pre-compute visibility, only visible surfaces may be refined for real-time selective refinement. Compared to selective refinement without incorporating occlusion culling, our implementation of the framework demonstrates significant polygon count reduction and speedup in frame rate.|
|Source Title:||Proceedings of the Symposium on Interactive 3D Graphics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.