Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Ray Maps for Global Illumination


Havran,  Vlastimil
Computer Graphics, MPI for Informatics, Max Planck Society;


Herzog,  Robert
Computer Graphics, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;


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

Havran, V., Bittner, J., Herzog, R., & Seidel, H.-P. (2005). Ray Maps for Global Illumination. In O. Deussen, A. Keller, K. Bala, P. Dutré, D. W. Fellner, & S. N. Spencer (Eds.), Rendering Techniques 2005: Eurographics Symposium on Rendering (pp. 43-54). Aire-la-Ville, Switzerland: Eurographics Association.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-277D-B
We describe a novel data structure for representing light transport called ray
map. The ray map extends the concept of photon maps: it stores not only photon
impacts but the whole photon paths. We demonstrate the utility of ray maps for
global illumination by eliminating boundary bias and reducing topological bias
of density estimation in global illumination. Thanks to the elimination of
boundary bias we could use ray maps for fast direct visualization with the
image quality being close to that obtained by the expensive final gathering
step. We describe in detail our implementation of the ray map using a lazily
constructed kD-tree. We also present several optimizations bringing the ray map
query performance close to the performance of the photon map.