Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Exploiting Hardware-Accelerated Occlusion Queries for Visibility Culling Chih-Kang HSU Wen-Kai TAI Cheng-Chin CHIANG Mau-Tsuen YANG Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E88-A No.7 pp.2007-2014 Publication Date: 2005/07/01 Online ISSN: DOI: 10.1093/ietfec/e88-a.7.2007 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Computer Graphics Keyword: 2-tier view frustum culling, occlusion culling, hardware-accelerated occlusion query, grid, front-to-back order, eye-siding number, interactive walkthrough, Full Text: PDF(482.7KB)>>
Summary: Visibility culling techniques have been studied extensively in computer graphics for interactive walkthrough applications in recent years. In this paper, a visibility culling approach by exploiting hardware-accelerated occlusion query is proposed. Organizing the regular grid representation of input scene as an octree-like hierarchy, a 2-tier view frustum culling algorithm is to efficiently cull away nodes invisible from a given viewpoint. Employing the eye-siding number of nodes, we can quickly enumerate an occlusion front-to-back order and effectively maximize the number of parallelizable occlusion queries for nodes while traversing the hierarchy. As experimental results show, our approach improves the overall performance in the test walkthrough. | ||||||||||
| ||||||||||
