English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Balancing Considered Harmful - Faster Photon Mapping using the Voxel Volume Heuristic

MPS-Authors
/persons/resource/persons45688

Wald,  Ingo
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44542

Günther,  Johannes
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

Wald, I., Günther, J., & Slusallek, P. (2004). Balancing Considered Harmful - Faster Photon Mapping using the Voxel Volume Heuristic. In The European Association for Computer Graphics 25th Annual Conference EUROGRAPHICS 2004 (pp. 595-603). Oxford, UK: Blackwell.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2A35-8
Abstract
Photon mapping is one of the most important algorithms for computing global illumination. Especially for effi- ciently producing convincing caustics, there are no real alternatives to photon mapping. On the other hand, photon mapping is also quite costly: Each radiance lookup requires to find the k nearest neighbors in a kd-tree, which can be more costly than shooting several rays. Therefore, the nearest-neighbor queries often dominate the rendering time of a photon map based renderer. In this paper, we present a method that reorganizes i.e. unbalances the kd-tree for storing the photons in a way that allows for finding the k-nearest neighbors much more efficiently, thereby accelerating the radiance estimates by a factor of 1.2 3.4. Most importantly, our method still finds exactly the same k-nearest-neighbors as the original method, without introducing any approximations or loss of accuracy. The impact of our method is demonstrated with several practical examples.