A Survey of Real-time Soft Shadows Algorithms

The algorithm is decomposed into two steps: first, it computes the shadow map from the light and then, for each pixel of the V-buffer, if its corresponding point p is in the

5.1 shows, the average number of visible triangles (and hence hit beams) at each pixel tends to be significantly lower than for primary visibility (less than 10 for our test

To compute soft shadows for semi-transparent objects due to a large area light source, we modify the multilayer depth map ray tracing algorithm to support a multilayer

We propose a new method for rendering isosurfaces at interactive rates while supporting dynamic ambient occlusion and/or soft shadows and requiring minimal pre-computation time..

Our algorithms cover a broad range of applications from real-time anti-aliasing of shadow discon- tinuities to rendering all-frequency shadows, in fully dynamic environments

These include shadows cast on planes parallel to the ground plane, which requires the attachment points and the light vanishing point to be defined on the shadow plane (Figures 5

Our novel method is able to reproduce a large variety of GI effects for moderately sized scenes at interactive rates, such as indirect lighting, soft shadows under environment

Figure 1: Our proposed method is capable of selecting and rendering a significantly reduced amount of shadow maps needed for a physically correct soft shadow solution using an