Sciweavers

20 search results - page 1 / 4
» OpenGL-assisted occlusion culling for large polygonal models
Sort
View
VMV
2001
112views Visualization» more  VMV 2001»
13 years 5 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...
CG
1999
Springer
13 years 4 months ago
OpenGL-assisted occlusion culling for large polygonal models
Dirk Bartz, Michael Meißner, Tobias Hüt...
CG
2004
Springer
13 years 4 months ago
Occlusion Culling in OpenSG PLUS
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...
Dirk Staneker, Dirk Bartz, Wolfgang Straßer
WSCG
2001
98views more  WSCG 2001»
13 years 5 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
CGI
1998
IEEE
13 years 8 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&...