Bitmask Soft Shadows
- 1 September 2007
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 26 (3) , 515-524
- https://doi.org/10.1111/j.1467-8659.2007.01074.x
Abstract
Recently, several real‐time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The resulting micropatches are backprojected onto the light source and the light areas occluded by them get accumulated to estimate overall light occlusion. This approach ignores patch overlaps, however, which can lead to objectionable artifacts. In this paper, we propose to determine the visibility of the light source with a bit field where each bit tracks the visibility of a sample point on the light source. This approach not only avoids overlapping‐related artifacts but offers a solution to the important occluder fusion problem. Hence, it also becomes possible to correctly incorporate information from multiple depth maps. In addition, a new interpretation of the shadow map data is suggested which often provides superior visual results. Finally, we show how the search area for potential occluders can be reduced substantially.Keywords
This publication has 9 references indexed in Scilit:
- Soft Shadow Maps: Efficient Sampling of Light Source VisibilityComputer Graphics Forum, 2006
- Real-time GPU rendering of piecewise algebraic surfacesACM Transactions on Graphics, 2006
- The Direct3D 10 systemACM Transactions on Graphics, 2006
- N-Buffers for efficient depth map queryComputer Graphics Forum, 2005
- Hierarchical Penumbra CastingComputer Graphics Forum, 2005
- Approximate Soft Shadows win an Image‐Space Flood‐Fill AlgorithmComputer Graphics Forum, 2004
- A Survey of Real‐time Soft Shadows AlgorithmsComputer Graphics Forum, 2003
- A geometry-based soft shadow volume algorithm using graphics hardwareACM Transactions on Graphics, 2003
- A model of visual masking for computer graphicsPublished by Association for Computing Machinery (ACM) ,1997