b'@inproceedings{Havran-et-al_EUROGRAPHICS05,'b'\nTITLE = {Fast Final Gathering via Reverse Photon Mapping},\nAUTHOR = {Havran, Vlastimil and Herzog, Robert and Seidel, Hans-Peter},\nLANGUAGE = {eng},\nISSN = {0167-7055},\nDOI = {10.1111/j.1467-8659.2005.00857.x},\nLOCALID = {Local-ID: C125675300671F7B-0EECF60691827774C12570B3004AE164-Havran2005eg05},\nPUBLISHER = {Blackwell},\nPUBLISHER = {Blackwell-Wiley},\nYEAR = {2005},\nDATE = {2005},\nABSTRACT = {We present a new algorithm for computing indirect illumination based on density
estimation similarly to photon mapping. We accelerate the search for final
gathering by reorganizing the computation in the reverse order. We use two
trees that organize spatially not only the position of photons but also the
position of final gather rays. The achieved speedup is algorithmic, the
performance improvement takes advantage of logarithmic complexity of searching
in trees. The algorithm requires almost no user settings unlike many known
acceleration techniques for photon mapping. The image quality is the same as
for traditional photon mapping with final gathering, since the algorithm does
not approximate or interpolate. Optionally, the algorithm can be combined with
other techniques such as density control and importance sampling. The algorithm
creates a coherent access pattern to the main memory. This further improves on
performance and also allows us to use efficient external data structures to
alleviate the increased memory requirements.},\nBOOKTITLE = {The European Association for Computer Graphics 26th Annual Conference: EUROGRAPHICS 2005},\nEDITOR = {Alexa, Marc and Marks, Joe},\nPAGES = {323--333},\nJOURNAL = {Computer Graphics Forum},\nVOLUME = {24},\nISSUE = {3},\nADDRESS = {Dublin, Ireland},\n}\n'