Low Latency Photon Mapping Using Block Hashing

Ma, Vincent C. H.; McCool, Michael D.

Low Latency Photon Mapping Using Block Hashing

Date

2002

Authors

Ma, Vincent C. H.
McCool, Michael D.

Publisher

The Eurographics Association

Abstract

For hardware accelerated rendering, photon mapping is especially useful for simulating caustic lighting effects on non-Lambertian surfaces. However, an efficient hardware algorithm for the computation of the k nearest neighbours to a sample point is required. Existing algorithms are often based on recursive spatial subdivision techniques, such as kd-trees. However, hardware implementation of a tree-based algorithm would have a high latency, or would require a large cache to avoid this latency on average. We present a neighbourhood-preserving hashing algorithm that is low-latency and has sub-linear access time. This algorithm is more amenable to fine-scale parallelism than tree-based recursive spatial subdivision, and maps well onto coherent block-oriented pipelined memory access. These properties make the algorithm suitable for implementation using future programmable fragment shaders with only one stage of dependent texturing.

        @inproceedings{:10.2312/EGGH/EGGH02/089-098
,
booktitle = {SIGGRAPH/Eurographics Workshop on Graphics Hardware
},
editor = {Thomas Ertl and Wolfgang Heidrich and Michael Doggett
},
title = {{Low Latency Photon Mapping Using Block Hashing
}},
author = {Ma, Vincent C. H. and 
McCool, Michael D.
},
year = {2002
},
publisher = {The Eurographics Association
},
ISSN = {1727-3471
},
ISBN = {1-58113-580-1
},
DOI = {/10.2312/EGGH/EGGH02/089-098
}
}

URI

https://doi.org/10.2312/EGGH/EGGH02/089-098

Collections

EGGH02: SIGGRAPH/Eurographics Workshop on Graphics Hardware 2002

Full item page