Advertisement

Predictive Occlusion Culling for Interactive Rendering of Large Complex Virtual Scene

  • Hua Xiong
  • Zhen Liu
  • Aihong Qin
  • Haoyu Peng
  • Xiaohong Jiang
  • Jiaoying Shi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4270)

Abstract

We present an efficient occlusion culling algorithm for interactive rendering of large complex virtual scene with high depth complexity. Our method exploits both spatial and temporal coherence of visibility. A space hierarchy of scene is constructed and its nodes are rendered in an approximate front-to-back order. Nodes in view frustum are inserted into one of layered node lists, called layered buffers(LBs), according to its distance to the view point. Each buffer in the LBs is rendered with hardware occlusion queries. Using a visibility predictor(VP) for each node and interleaving occlusion queries with rendering, we reduce the occlusion queries count and graphics pipeline stalls greatly. This occlusion culling algorithm can work in a conservative way for high image quality rendering or in an approximate way for time critical rendering. Experimental results of different types of virtual scene are provided to demonstrate its efficiency and generality.

Keywords

Temporal Coherence Graphic Hardware Virtual Scene Parallel Rendering Interactive Rendering 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aliaga, D., Cohen, J., Wilson, A., Zhang, H.S., Erikson, C., Hoff III, K.E., Hudson, T., Stuerzlinger, W., Bastos, R., Whitton, M., Brooks, F., Manocha, D.: MMR: An Integrated Massive Model Rendering System using Geometric and Image-based Acceleration. In: Proceedings of ACM Symposium on Interactive 3D Graphics, pp. 199–206 (1999)Google Scholar
  2. 2.
    Airey, J.: Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations. Ph.D thesis, University of North Carolina, Chapel Hill, USA (1991)Google Scholar
  3. 3.
    Aila, T., Miettinen, V., Nordlund, P.: Delay Streams for Graphics Hardware. ACM Transactions on Graphics 22, 792–800 (2003)CrossRefGoogle Scholar
  4. 4.
    Bittner, J., Wonka, P.: Visibility in Computer Graphics. Environment and Planning B: Planning and Design 30, 729–756 (2003)CrossRefGoogle Scholar
  5. 5.
    Bittner, J., Havran, V., Slavik, P.: Hierarchical Visibility Culling with Occlusion Trees. Computer Graphics International, 207–219 (1998)Google Scholar
  6. 6.
    Baxter III, W.V., Sud, A., Govindaraju, N., Manocha, D.: GigaWalk: Interactive Walkthrough of Complex Environments. In: Proceedings of Eurographics Workshop on Rendering, pp. 203–214 (2002)Google Scholar
  7. 7.
    Cohen-Or, D., Chrysanthou, Y.L., Silva, C.T., Durand, F.: A Survey of Visibility for Walkthrough Applications. IEEE Transactions on Visualization and Computer Graphics 9, 412–431 (2003)CrossRefGoogle Scholar
  8. 8.
    Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., Scopigno, R.: Adaptive TetraPuzzles: Efficient Out-of-Core Construction and Visualization of Gigantic Polygonal Models. ACM Transactions on Graphics 23, 796–803 (2004)CrossRefGoogle Scholar
  9. 9.
    Correa, W., Klosowski, J., Silva, C.T.: iWalk: Interactive Out-of-Core Rendering of Large Models. Technical Report TR-653-02, Princeton University (2002)Google Scholar
  10. 10.
    Durand, F.: 3D Visibility: Analytical study and Applications. Ph.D thesis, Universite Joseph Fourier, Grenoble, France (1999)Google Scholar
  11. 11.
    Greene, N., Kass, M., Miller, G.: Hierarchical Z-buffer Visibility. In: Proceedings of ACM SIGGRAPH 1993, pp. 231–238 (1993)Google Scholar
  12. 12.
    Hillesland, K., Salomon, B., Lastra, A., Manocha, D.: Fast and Simple Occlusion Culling using Hardware-based Depth Queries. Technical Report TR02-039, Department of Computer Science, University of North Carolina, Chapel Hill (2002)Google Scholar
  13. 13.
    Klosowski, J.T., Silva, C.T.: Efficient Conservative Visibility Culling using the Prioritized-layered Projection Algorithm. IEEE Transactions on Visualization and Computer Graphics 7, 365–379 (2001)CrossRefGoogle Scholar
  14. 14.
    Morein, S.: ATI Radeon HyperZ Technology. In: Proceedings of Workshop on Graphics Hardware, ACM SIGGRAPH (2000)Google Scholar
  15. 15.
    Silva, C.T., Chiang, Y.-J., El-Sana, J., Lindstrom, P., Pajarola, R.: Out-of-Core Algorithms for Scientific Visualization and Computer Graphics. In: IEEE Visualization 2003, Tutorial 4 (2003)Google Scholar
  16. 16.
    Yoon, S.E., Salomon, B., Gayle, R., Manocha, D.: Quick-VDR: Interactive View-Dependent Rendering of Gigantic Models. IEEE Transactions on Visualization and Computer Graphics 11, 369–382 (2005)CrossRefGoogle Scholar
  17. 17.
    Zhang, H.S., Manocha, D., Hudson, T., Hoff III, K.E.: Visibility Culling using Hierarchical Occlusion Maps. In: Proceedings of SIGGRAPH 1997, pp. 77–88 (1997)Google Scholar
  18. 18.
    Bittner, J., Wimmer, M., Piringer, H., Purgathofer, W.: Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful. In: Proceedings of Eurographics 2004, pp. 615–624 (2004)Google Scholar
  19. 19.
    Zhang, M.M., Pan, Z.G., Heng, P.A.: A Near Constant Frame-Rate Rendering Algorithm Based on Visibility Computation and Model Simplification. Journal of Visualization and Computer Animation 14, 1–13 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hua Xiong
    • 1
  • Zhen Liu
    • 1
  • Aihong Qin
    • 1
  • Haoyu Peng
    • 1
  • Xiaohong Jiang
    • 1
  • Jiaoying Shi
    • 1
  1. 1.State Key Lab of CAD&CGZhejiang UniversityHangZhouP.R. China

Personalised recommendations