Shadow volume reconstruction from depth maps
ACM Transactions on Graphics (TOG)
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Shadow algorithms for computer graphics
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Casting curved shadows on curved surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
A geometry-based soft shadow volume algorithm using graphics hardware
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Silhouette Smoothing for Real-Time Rendering of Mesh Surfaces
IEEE Transactions on Visualization and Computer Graphics
ACM SIGGRAPH Asia 2008 papers
Logarithmic perspective shadow maps
ACM Transactions on Graphics (TOG)
High-quality spatio-temporal rendering using semi-analytical visibility
ACM SIGGRAPH 2011 papers
Temporal light field reconstruction for rendering distribution effects
ACM SIGGRAPH 2011 papers
Proceedings of the 2011 SIGGRAPH Asia Conference
Real-Time shadow volume algorithm for subdivision surface based models
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
| Hi-index | 0.00 |
We propose an efficient and light-weight solution for rendering smooth shadow boundaries that do not reveal the tessellation of the shadow-casting geometry. Our algorithm reconstructs the smooth contours of the underlying mesh and then extrudes shadow volumes from the smooth silhouettes to render the shadows. For this purpose we propose an improved silhouette reconstruction using the vertex normals of the underlying smooth mesh. Then our method subdivides the silhouette loops until the contours are sufficiently smooth and project to smooth shadow boundaries. This approach decouples the shadow smoothness from the tessellation of the geometry and can be used to maintain equally high shadow quality for multiple LOD levels. It causes only a minimal change to the fill rate, which is the well-known bottleneck of shadow volumes, and hence has only small overhead. © 2012 Wiley Periodicals, Inc.