By Topic

Dynamic scene occlusion culling using a regular grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. C. Batagelo ; Sch. of Electr. & Comput. Eng., State Univ. of Campinas, Brazil ; Wu Shin-Ting

We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular grid that represents a volumetric discretization of the space and uses the opaque regions of the scene as virtual occluders. We introduce new techniques of efficient traversal of voxels, object discretization and occlusion computation that strengthen the benefits of regular grids in dynamic scenes. The method also exploits temporal coherence and realizes occluder fusion in object-space. For each frame, the algorithm computes a conservative set of visible objects that greatly accelerates the visualization of complex dynamic scenes. We discuss the results of a 2D and 3D case implementation.

Published in:

Computer Graphics and Image Processing, 2002. Proceedings. XV Brazilian Symposium on

Date of Conference: