Occlusion Culling and Z-fail for Soft Shadow Volume Algorithms
Artikel i vetenskaplig tidskrift, 2004

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.

shadow volumes

soft shadows

graphics hardware


Ulf Assarsson

Chalmers, Institutionen för datorteknik, Real-time Computer Graphics

Tomas Akenine-Möller

Chalmers, Institutionen för datorteknik, Real-time Computer Graphics

Visual Computer

0178-2789 (ISSN) 1432-2315 (eISSN)

Vol. 20 8-9 601-612


Datavetenskap (datalogi)



Mer information