Thumbnail
Access Restriction
Subscribed

Author Roden, Timothy ♦ Parberry, Ian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Portal rendering ♦ Occlusion culling ♦ Visibility
Abstract We describe a simple and efficient dynamic occlusion- culling algorithm for computing potentially visible sets (PVS) in densely occluded virtual environments. Our method is an optimization of a widely used technique in which a 3D environment is divided into cells and portals. Our algorithm computes the PVS in approximately half the time of previous portal methods at the expense of producing a slightly relaxed PVS. In addition, our algorithm enables fast culling of objects within cells using inexpensive object-space methods by using a lookup table to compute the diminished object-space view frustum. The algorithm takes advantage of temporal coherence, is easy to implement, and is particularly well suited for applications that need to compute a PVS for use in non-rendering tasks such as AI.
Description Affiliation: University of North Texas (Roden, Timothy; Parberry, Ian)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-03-01
Publisher Place New York
Journal Computers in Entertainment (CIE) (CIE)
Volume Number 3
Issue Number 2
Page Count 1
Starting Page 3
Ending Page 3


Open content in new tab

   Open content in new tab
Source: ACM Digital Library