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

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.

[1]  Philipp Slusallek,et al.  A Scalable Approach to Interactive Global Illumination , 2003, Comput. Graph. Forum.

[2]  James T. Kajiya,et al.  The rendering equation , 1986, SIGGRAPH.

[3]  H. Jensen.  Realistic Image Synthesis Using Photon Mapping , 2001 .

[4]  Philipp Slusallek,et al.  Distributed interactive ray tracing of dynamic scenes , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[5]  Ingo Wald,et al.  Realtime ray tracing and interactive global illumination , 2004, Ausgezeichnete Informatikdissertationen.

[6]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

[7]  Markus Wagner,et al.  Interactive Rendering with Coherent Ray Tracing , 2001, Comput. Graph. Forum.

[8]  James Arvo,et al.  A clustering algorithm for radiosity in complex environments , 1994, SIGGRAPH.

[9]  Philippe Bekaert,et al.  Advanced global illumination , 2006 .

[10]  Michael D. McCool,et al.  Low latency photon mapping using block hashing , 2002, HWWS '02.

[11]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[12]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[13]  Alexander Reshetov,et al.  Fast Ray Tracing for Modern General Purpose CPU , 2002 .

[14]  Henrik Wann Jensen,et al.  Rendering Caustics on Non‐Lambertian Surfaces , 1996, Comput. Graph. Forum.

[15]  Leonidas J. Guibas,et al.  Metropolis light transport , 1997, SIGGRAPH.

[16]  Vlastimil Havran,et al.  Analysis of Cache Sensitive Representation for Binary Space Partitioning Trees , 1999, Informatica.

[17]  Pat Hanrahan,et al.  A rapid hierarchical radiosity algorithm , 1991, SIGGRAPH.

[18]  Wolfgang Straßer,et al.  Real‐Time Caustics , 2003, Comput. Graph. Forum.

[19]  Per H. Christensen.  Faster Photon Map Global Illumination , 1999, J. Graphics, GPU, & Game Tools.

[20]  Peter Shirley,et al.  Monte Carlo techniques for direct lighting calculations , 1996, TOGS.

[21]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[22]  Philipp Slusallek,et al.  Interactive headlight simulation: a case study of interactive distributed ray tracing , 2002, EGPGV.

[23]  Ingo Wald.  Photorealistic Rendering using the PhotonMap , 1999 .

[24]  Kellogg S. Booth,et al.  Report from the chair , 1986 .

[25]  Philipp Slusallek,et al.  Realtime Ray Tracing and its use for Interactive Global Illumination , 2003, Eurographics.

[26]  Alexander Keller,et al.  Instant radiosity , 1997, SIGGRAPH.

[27]  Pat Hanrahan,et al.  Photon mapping on programmable graphics hardware , 2003, HWWS '03.

[28]  Henrik Wann Jensen,et al.  Global Illumination using Photon Maps , 1996, Rendering Techniques.

[29]  Philipp Slusallek,et al.  Interactive Global Illumination using Fast Ray Tracing , 2002, Rendering Techniques.

[30]  Kalpathi R. Subramanian,et al.  A Search Structure based on K-d Trees for Efficient Ray Tracing , 1990 .

[31]  Leonidas J. Guibas,et al.  Bidirectional Estimators for Light Transport , 1995 .

[32]  Vlastimil Havran,et al.  Heuristic ray shooting algorithms , 2000 .

[33]  A. Karimi,et al.  Master‟s thesis , 2011 .