Online Occlusion Culling

  • Gereon Frahling
  • Jens Krokowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)


Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these polygons is visible. We address the problem of occlusion culling, i.e., determine hidden primitives. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them [2]. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.

We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform the FIFO strategy for real 3D scenes as well.


Competitive Ratio Online Algorithm Size Model Cache Size Competitive Algorithm 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 419–430. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Aila, T., Miettinen, V., Nordlund, P.: Delay streams for graphics hardware. ACM Transactions on Graphics 22(3), 792–800 (2003)CrossRefGoogle Scholar
  3. 3.
    Becchetti, L.: Modeling Locality: A Probabilistic Analysis of LRU and FWF. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 98–109. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)MATHGoogle Scholar
  5. 5.
    Catmull, E.: A Subdivision Algorithm for Computer Display of Curved Surfaces. PhD thesis, University of Utah (1974)Google Scholar
  6. 6.
    Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: USENIX Symposium on Internet Technologies and Systems (1997)Google Scholar
  7. 7.
    Chrobak, M., Karloff, H., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM Journal on Discrete Mathematics 4(2), 172–181 (1991)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cohen-Or, D., Chrysanthou, Y., Silva, C., Durand, F.: A survey of visibility for walkthrough applications. Transactions on Visualization and Computer Graphics 9(3), 412–431 (2003)CrossRefGoogle Scholar
  9. 9.
    Coorg, S.R., Teller, S.J.: Real-time occlusion culling for models with large occluders. In: Symposium on Interactive 3D Graphics, pp. 83–90, 189 (1997)Google Scholar
  10. 10.
    Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: On competitive paging algorithms. Journal of Algorithms 12, 685–699 (1991)MATHCrossRefGoogle Scholar
  11. 11.
    McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Greene, N., Kass, M., Miller, G.: Hierarchical z-buffer visibility. In: Proc. of ACM SIGGRAPH 1993, pp. 231–238 (1993)Google Scholar
  13. 13.
    Leyvand, T., Sorkine, O., Cohen-Or, D.: Ray Space Factorization for From-Region Visibility. ACM Transactions on Graphics 22(3), 595–604 (2003)CrossRefGoogle Scholar
  14. 14.
    Shreiner, D.: Performance opengl: Platform independent techniques. In: ACM SIGGRAPH 2001 course notes (2001)Google Scholar
  15. 15.
    Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Young, N.E.: Online file caching. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 82–86 (1998)Google Scholar
  18. 18.
    Zhang, H., Manocha, D., Hudson, T., Hoff, K.: Visibility culling using hierarchical occlusion maps. In: Proc. of ACM SIGGRAPH 1997, pp. 77–88 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gereon Frahling
    • 1
  • Jens Krokowski
    • 1
  1. 1.Heinz Nixdorf Institute, Computer Science DepartmentUniversity of PaderbornPaderbornGermany

Personalised recommendations