Abstract
Occlusion culling has been studied extensively in computer graphics for years. In this paper, an occlusion culling approach based on exploiting multiple hardware-accelerated occlusion queries using the concept of eye-siding number for dynamic scene is proposed. Organizing the regular grid with overlapping voxels for the scene as an octree-like hierarchy, the actual position of dynamical objects can be updated efficiently. Based on the eye-siding number, the nodes occlusion front-to-back order enumeration can be done efficiently and the number of parallelizable occlusion queries for nodes in the hierarchy while traversing can be maximized efficiently and effectively. As experimental results shown, for all frames of the test walk-through in a dynamical environment, our approach does improve the overall performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bartz, D., Klosowski, J., Staneker, D.: K-dops as Tighter Bounding Volumes for Better Occlusion Performance. In: SIGGRAPH Visual Proceedings (2001)
Bartz, D., Meibner, M., Huttner, T.: OpenGL Assisted Occlusion Culling for Large Polygonal Models. C&G 23(3), 667–679 (1999)
Batagelo, H.C., Wu, S.T.: Dynamic Scene Occlusion Culling Using a Regular Grid. In: XV Brazilian Symp. on Comp. Graph. & Image Proc., pp. 43–50 (2002)
Bernardini, F., El-Sana, J., Klosowski, J.T.: IDirectional Discretized Occluders for Accelerated Occlusion Culling. In: EUROGRAPHICS (2000)
Bittner, J., Havran, V., Slavk, P.: Hierarchical Visibility Culling with Occlusion Trees. In: Comp. Graph. Int. 1998, pp. 207–219 (1998)
Cohen-Or, D., Chrysanthou, Y.L., Silva, C.T., et al.: Survey of Visibility for Walkthrough Applications. IEEE TVCG 9(3) (2003)
Durand, F., Drettakis, G., Thollot, J., Puech, C.: Conservative Visibility Preprocessing Using Extended Projections. In: SIGGRAPH (2000)
Govindaraju, N.K., Sud, A., et al.: Interactive Visibility Culling for Complex Environments Using Occlusion-Switches. In: Symp. I3D (2003)
Greene, N.: Occlusion Culling with Optimized Hierarchical Z-buffering. ACM SIGGRAPH Course Notes on Visibility 30 (2001)
Heo, J., Kim, J., Wohn, K.: Conservative Visibility Preprocessing forWalkthroughs of Complex Urban Scenes. In: ACM Symp. on VRST (2000)
Hillesland, K., Salomon, B., Lastra, A., Manocha, D.: Fast and Simple Occlusion Culling Using Hardware-Based Depth Queries. Technical report TR02-039, Dep of Comp Sci, Univ of North Carolina (2002)
Ho, P.C., Wang, W.: Occlusion Culling Using Minimum Occluder Set and Opacity Map. In: Int. IEEE Conference on Information Visualisation (1999)
Kim, J., Wohn, K.: Conservative Visibility Preprocessing for Complex Virtual Environments. In: VSMM (2001)
Klosowski, J.T., Silva, C.T.: The Prioritized-Layered Projection Algorithm for Visible Set Estimation. IEEE TVCG 6(2) (2000)
Klosowski, J.T., Silva, C.T.: Efficient Conservative Visibility Culling Using the Prioritized-layered Projection Algorithm. IEEE TVCG 7(4), 265–379 (2001)
Koltun, V., Chrysanthou, Y., Cohen-Or, D.: Hardware-Accelerated From-Region Visibility Using a Dual Ray Space. In: Eurographics Workshop on Rendering, pp. 205–216 (2001)
Koltun, V., Chrysanthou, Y., Cohen-Or, D.: Virtual Occluders: An Efficient Intermediate PVS Representation. In: Eurographics Workshop on Rendering (2000)
Meissner, M., Bartz, D., et al.: Generation of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models. Computer and Graphics (2002)
Pastor, O.E.M.: Visibility Preprocessing using Spherical Sampling of Polygonal Patches. In: Eurographics, Short/Poster Presentations (2002)
Schaufler, G., Dorsey, J., Decoret, X., Sillion, F.X.: Conservative Volumetric Visibility with Occluder Fusion. In: SIGGRAPH (2000)
Shou, L., Huang, Z., Tan, K.L.: Performance Guaranteed Rendering Using The HDoV Tree. In: GRAPHITE (2003)
Staneker, D., Bartz, D., Meibner, M.: Improving Occlusion Query Efficiency with Occupancy Maps. In: Symp. on Parallel and Large-Data Vis. and Graph. (2003)
Sudarsky, O., Gotsman, C.: Dynamic Scene Occlusion Culling. IEEE TVCG 5(1), 13–29 (1999)
Wonka, P., Wimmer, M., Schmalstieg, D.: Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs. In: Eurographics Workshop on Rendering, pp. 71–82 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tai, WK., Hsu, CK., Hsieh, HH. (2004). An Occlusion Culling Approach Based on Exploiting Multiple Hardware-Accelerated Occlusion Queries for Dynamical Scenes. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive