Lazy Visibility Evaluation for Exact Soft Shadows
| dc.contributor.author | Mora, F. | en_US |
| dc.contributor.author | Aveneau, L. | en_US |
| dc.contributor.author | Apostu, O. | en_US |
| dc.contributor.author | Ghazanfarpour, D. | en_US |
| dc.contributor.editor | Holly Rushmeier and Oliver Deussen | en_US |
| dc.date.accessioned | 2015-02-28T08:25:30Z | |
| dc.date.available | 2015-02-28T08:25:30Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | This paper presents a novel approach to compute high quality and noise‐free soft shadows using exact visibility computations. This work relies on a theoretical framework allowing to group lines according to the geometry they intersect. From this study, we derive a new algorithm encoding lazily the visibility from a polygon. Contrary to previous works on from-polygon visibility, our approach is very robust and straightforward to implement. We apply this algorithm to solve exactly and efficiently the visibility of an area light source from any point in a scene. As a consequence, results are not sensitive to noise, contrary to soft shadows methods based on area light source sampling. We demonstrate the reliability of our approach on different scenes and configurations. | en_US |
| dc.description.number | 1 | |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 31 | |
| dc.identifier.doi | 10.1111/j.1467-8659.2011.02089.x | |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2011.02089.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Lazy Visibility Evaluation for Exact Soft Shadows | en_US |