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

• Published in: Computer graphics forum Vol. 23; no. 3; pp. 595 - 603
• Main Authors: Waldyz, Ingo, Günthery, Johannes, Slusalleky, Philipp
• Format: Journal Article
• Language: English
• Published: Oxford, UK and Boston, USA Blackwell Publishing, Inc 01.09.2004; Blackwell Publishing Ltd
• Subjects: Atoms & subatomic particles; caustics; Computer graphics; Global Illumination; kd-tree; nearest neighbor query; photon mapping; simulation; Studies
• ISSN: 0167-7055; 1467-8659
• DOI: 10.1111/j.1467-8659.2004.00791.x

Photon mapping is one of the most important algorithms for computing global illumination. Especially for efficiently 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. un balances — 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. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Global Illumination I.3.7 [Computer Graphics]: Raytracing