Geometric Simplification for Efficient Occlusion Culling in Urban Scenes
نویسندگان
چکیده
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these occluders are large and simple. For complex scenes it is worthwhile to generate virtual occluders to replace complex occluder geometries by simple polygonal structures. In urban scenes, the facade of buildings comprises most of the occlusion potential. In this paper we present an algorithm to extract simplified facades from complex building models, exploiting the fact that, in most cases, buildings have a 2.5D structure.
منابع مشابه
A First Step towards Occlusion Culling in OpenSG PLUS
The fast increasing size of datasets in scientific computing, mechanical engineering, or virtual medicine is quickly exceeding the graphics capabilities of modern computers. Toolkits for the large model visualization address this problem by combining efficient geometric techniques, such as occlusion and visibility culling, mesh reduction, and efficient rendering. OpenSG PLUS is such a toolkit w...
متن کاملGeneration of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present t...
متن کاملGeneration of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplishing this goal. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present three adapted ...
متن کاملSpacetime Catmull Recursive Subdivision facilitated with Occlusion Culling
We describe an extension and a generalization of the Catmull recursive subdivision algorithm: first, an imagebased occlusion culling stage is added; second, all rendering stages, that is, view-frustum and occlusion culling, subdivision of geometric primitives into micropolygons, and rasterization, are performed in spacetime. Operating in spacetime allows to exploit temporal coherence in animate...
متن کاملOcclusion Culling Methods
Occlusion culling methods are an important tool for efficient rendering of large scenes. Usually only a small part of such a scene is visible from a specific viewpoint. Therefore occlusion culling methods try to determine which parts of the scene are invisible and can be culled. That way usually only a small part of the scene ́s primitives has to be drawn. This is especially important for real-t...
متن کامل