Show simple item record

dc.contributor.authorBaran, Ilya
dc.contributor.authorChen, Jiawen
dc.contributor.authorRagan-Kelley, Jonathan Millar
dc.contributor.authorDurand, Fredo
dc.contributor.authorLehtinen, Jaakko
dc.date.accessioned2012-09-20T18:58:46Z
dc.date.available2012-09-20T18:58:46Z
dc.date.issued2010-12
dc.identifier.urihttp://hdl.handle.net/1721.1/73080
dc.description.abstractVolumetric effects such as beams of light through participating media are an important component in the appearance of the natural world. Many such effects can be faithfully modeled by a single scattering medium. In the presence of shadows, rendering these effects can be prohibitively expensive: current algorithms are based on ray marching, i.e., integrating the illumination scattered towards the camera along each view ray, modulated by visibility to the light source at each sample. Visibility must be determined for each sample using shadow rays or shadow-map lookups. We observe that in a suitably chosen coordinate system, the visibility function has a regular structure that we can exploit for significant acceleration compared to brute force sampling. We propose an efficient algorithm based on partial sum trees for computing the scattering integrals in a single-scattering homogeneous medium. On a CPU, we achieve speedups of 17--120x over ray marching.en_US
dc.description.sponsorshipIntel Corporation (PhD Fellowship)en_US
dc.description.sponsorshipSingapore-MIT GAMBIT Game Laben_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1866158.1866200en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleA Hierarchical Volumetric Shadow Algorithm for Single Scatteringen_US
dc.typeArticleen_US
dc.identifier.citationIlya Baran, Jiawen Chen, Jonathan Ragan-Kelley, Frédo Durand, and Jaakko Lehtinen. 2010. A hierarchical volumetric shadow algorithm for single scattering. ACM Transactions on Graphics 29, 6, Article 178 (December 2010), 10 pages.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorBaran, Ilya
dc.contributor.mitauthorChen, Jiawen
dc.contributor.mitauthorRagan-Kelley, Jonathan Millar
dc.contributor.mitauthorDurand, Fredo
dc.contributor.mitauthorLehtinen, Jaakko
dc.relation.journalACM Transactions on Graphicsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsBaran, Ilya; Chen, Jiawen; Ragan-Kelley, Jonathan; Durand, Frédo; Lehtinen, Jaakkoen
dc.identifier.orcidhttps://orcid.org/0000-0001-9919-069X
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record