Lazy Occlusion Grid Culling
نویسندگان
چکیده
We present Lazy Occlusion Grid Culling, a new image-based occlusion culling technique for rendering of very large scenes which can be of general type. It is based on a low-resolution grid that is updated in a lazy manner and that allows fast decisions if an object is occluded or visible together with a hierarchical scene-representation to cull large parts of the scene at once. It is hardware-accelerateable and it works efficiently even on systems where pixel-based occlusion testing is implemented in software. Lazy Occlusion Grid Culling Heinrich Hey Robert F. Tobler Vienna University of Technology {hey,rft}@cg.tuwien.ac.at Abstract. We present Lazy Occlusion Grid Culling, a new image-based occlusion culling technique for rendering of very large scenes which can be of general type. It is based on a low-resolution grid that is updated in a lazy manner and that allows fast decisions if an object is occluded or visible together We present Lazy Occlusion Grid Culling, a new image-based occlusion culling technique for rendering of very large scenes which can be of general type. It is based on a low-resolution grid that is updated in a lazy manner and that allows fast decisions if an object is occluded or visible together with a hierarchical scene-representation to cull large parts of the scene at once. It is hardware-accelerateable and it works efficiently even on systems where pixel-based occlusion testing is implemented in software.
منابع مشابه
Real-Time Occlusion Culling with a Lazy Occlusion Grid
We present a new conservative image-based occlusion culling method to increase the speed of hardware accelerated rendering of very complex general scenes which may consist of millions of polygons without time-expensive preprocessing. The method is based on a lowresolution grid upon a conventional z-buffer or an occlusion-buffer. This grid is updated in a lazy manner which reduces the number of ...
متن کاملTight Conservative Occlusion Culling for Urban Visualization
In this paper we propose a framework for the visualization of urban environments In this context we also propose a novel tight conservative occlusion culling algorithm which brings a solution to the partial occlusion problem A conservative visibility culling algorithm accepts an object as completely visible even only a small portion of it is unoccluded In our algorithm we tried to avoid this by...
متن کاملDynamic Scene Occlusion Culling using a Regular Grid
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 occl...
متن کاملDynamic Scene Occlusion Culling Using a Regular Grid
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 occl...
متن کامل2D Dynamic Scene Occlusion Culling using a Regular Grid
The growth of complexity in the scene geometry of interactive applications makes the dynamic scene visibility determination a problem of increasing importance in computer graphics. In this work, we present an efficient occlusion culling technique for 2D densely occluded scenes where both the viewpoint and objects move arbitrarily. Our method operates on a regular grid that represents a discreti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999