English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Efficient Light Transport Using Precomputed Visibility

MPS-Authors
/persons/resource/persons44284

Daubert,  Katja
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44602

Heidrich,  Wolfgang
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44747

Kautz,  Jan
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45449

Seidel,  Hans-Peter       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Daubert, K., Heidrich, W., Kautz, J., Dischler, J.-M., & Seidel, H.-P. (2003). Efficient Light Transport Using Precomputed Visibility. IEEE Computer Graphics and Applications, 23(3), 28-37. doi:10.1109/MCG.2003.1198260.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2CD6-E
Abstract
Visibility computations are the most time-consuming part of
global illumination algorithms. The cost is amplified by the
fact that quite often identical or similar information is
recomputed multiple times. In particular this is the case when
multiple images of the same scene are to be generated under
varying lighting conditions and/or viewpoints. But even for a
single image with static illumination, the computations could be
accelerated by reusing visibility information for many different
light paths.

In this paper we describe a general method of precomputing,
storing, and reusing visibility information for light transport
in a number of different types of scenes. In particular, we
consider general parametric surfaces, triangle meshes without a
global parameterization, and participating media.

We also reorder the light transport in such a way that the
visibility information is accessed in structured memory access
patterns. This yields a method that is well suited for SIMD-style
parallelization of the light transport, and can efficiently be
implemented both in software and using graphics hardware. We
finally demonstrate applications of the method to highly
efficient precomputation of BRDFs, bidirectional texture
functions, light fields, as well as near-interactive volume
lighting.