Sciweavers

9 search results - page 1 / 2
» Generation of Decomposition Hierarchies for Efficient Occlus...
Sort
View
VMV
2001
112views Visualization» more  VMV 2001»
13 years 6 months ago
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 accomplis...
Michael Meißner, Dirk Bartz, Gordon Mül...
CGI
1998
IEEE
13 years 9 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
WSCG
2001
98views more  WSCG 2001»
13 years 6 months ago
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 oc...
Rick Germs, Frederik W. Jansen
ICVGIP
2008
13 years 6 months ago
Visibility Cuts: A System for Rendering Dynamic Virtual Environments
In recent years, the subject of occlusion culling of large 3D environments has received substantial contribution. However the major amount of research into the area has focussed o...
Soumyajit Deb, Ankit Gupta
RT
2001
Springer
13 years 9 months ago
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 mill...
Heinrich Hey, Robert F. Tobler, Werner Purgathofer