Accurate Computation of Single Scattering in Participating Media with Refractive Boundaries

Volume caustics are high‐frequency effects appearing in participating media with low opacity, when refractive interfaces are focusing the light rays. Refractions make them hard to compute, since screen locality does not correlate with spatial locality in the medium. In this paper, we give a new meth...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 34; no. 6; pp. 48 - 59
Main Author Holzschuch, N.
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.09.2015
Wiley
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Volume caustics are high‐frequency effects appearing in participating media with low opacity, when refractive interfaces are focusing the light rays. Refractions make them hard to compute, since screen locality does not correlate with spatial locality in the medium. In this paper, we give a new method for accurate computation of single scattering effects in a participating media enclosed by refractive interfaces. Our algorithm is based on the observation that although radiance along each camera ray is irregular, contributions from individual triangles are smooth. Our method gives more accurate results than existing methods, faster. It uses minimal information and requires no pre‐computation or additional data structures. Volume caustics are high‐frequency effects appearing in participating media with low opacity, when refractive interfaces are focusing the light rays. Refractions make them hard to compute, since screen locality does not correlate with spatial locality in the medium. In this paper, we give a new method for accurate computation of single scattering effects in a participating media enclosed by refractive interfaces. Our algorithm is based on the observation that although radiance along each camera ray is irregular, contributions from individual triangles are smooth. Our method gives more accurate results than existing methods, faster. It uses minimal information and requires no pre‐computation or additional data structures.
Bibliography:istex:A3A113010FFA2DC7DB653088E5C4648E7EB31E31
ark:/67375/WNG-KWJQRZTQ-1
ArticleID:CGF12517
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12517