Skip to main content
SpringerLink
Log in

Occlusion culling and z-fail for soft shadow volume algorithms

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

This paper presents a significant improvement of our previously proposed soft shadow volume algorithm for simulating soft shadows. By restructuring the algorithm, we can considerably simplify the computations, introduce efficient occlusion culling with speedups of 3–4 times, thus approaching real-time performance. We can also generalize the algorithm to produce correct shadows even when the eye is inside a shadowed region (using z-fail). We present and evaluate a three pass implementation of the restructured algorithm for near real-time rendering of soft shadows on a computer with a commodity graphics accelerator. However, preferably the rendering of the wedges should be implemented in hardware, and for this we suggest and evaluate a single pass algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akenine-Möller T, Assarsson U (2002) Approximate soft shadows on arbitrary surfaces using penumbra wedges. 13th Eurographics Workshop on Rendering. Eurographics, pp 309–318

  2. Assarsson U, Akenine-Möller T (2003) A geometry-based soft shadow volume algorithm using graphics hardware. Proceedings of ACM SIGGRAPH 2003, pp 511–520

  3. Assarsson U, Dougherty M, Mounier M, Akenine-Möller T (2003) An optimized soft shadow volume algorithm with real-time performance. Graphics Hardware 2003, ACM SIGGRAPH/Eurographics Workshop Proceedings, pp 33–40

  4. Everitt C, Kilgard MJ (2002) Practical and robust stenciled shadow volumes for hardware-accelerated rendering. http://developer.nvidia.com/

  5. Crow FC (1977) Shadow algorithms for computer graphics. SIGGRAPH ’77 Proceedings, pp 242–248

  6. Gottschalk S, Lin MC, Manocha D (1996) OBBTree: a hierarchical structure for rapid interference detection. Computer Graphics (SIGGRAPH Proceedings ’96), pp 171–180

  7. Greene N (1994) Detecting intersection of a rectangular solid and a convex polyhedron. In: Heckbert PS (ed) Graphics gems IV, pp 74–82

  8. Haines EA, Wallace JR (1994) Shaft culling for efficient ray-traced radiosity. Photorealistic rendering in computer graphics. (Proceedings of the Second Eurographics Workshop on Rendering), Springer, Berlin Heidelberg New York, pp 122–138

  9. Haines E, Möller T (2001) Real-time shadows. Game Developers Conference, March 2001, pp 335–352

  10. Heidmann T (1991) Real shadows, real time. Iris Universe, Silicon Graphics Inc., No. 18, pp 23–31

  11. Morein S (2000) ATI Radeon—HyperZ Technology. SIGGRAPH/Eurographics Graphics Hardware Workshop 2000, Hot3D session

  12. Parker S, Shirley P, Smits B (1999) Single sample soft shadows. TR UUCS-98-019, Computer Science Department, University of Utah

  13. Soler C, Sillion FX (1998) Fast calculation of soft shadow textures using convolution. SIGGRAPH ’98 Proceedings, pp 321–332

  14. Woo A, Poulin P, Fournier A (1990) A survey of shadow algorithms. IEEE Comput Graph Appl 10(6):13–32

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Chalmers University of Technology, Gothenburg, 412 63, Sweden

    Ulf Assarsson & Tomas Akenine-Möller

Authors
  1. Ulf Assarsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomas Akenine-Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomas Akenine-Möller.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Assarsson, U., Akenine-Möller, T. Occlusion culling and z-fail for soft shadow volume algorithms. Vis Comput 20, 601–612 (2004). https://doi.org/10.1007/s00371-004-0254-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-004-0254-2

Keywords

Search

Navigation