Divide-and-conquer system, method, and computer program product for providing photon mapping

摘要

A system, method, and computer program product are provided for hierarchical photon mapping. In use, photons and query locations are generated. Additionally, a bounding volume of the query locations is determined. Further, a set of the photons inside of the bounding volume is determined. It is then determined whether the set of photons and query locations meet predetermined criteria. If it is determined that the set of photons and query locations do not meet the predetermined criteria, the query locations are partitioned, and for each set of the query locations resulting from the partitioning, the above described steps for the hierarchical photon mapping are repeated. Once it is determined that the set of photons and query locations meet the predetermined criteria, a contribution of the set of photons to the query locations is computed.

主权项

1. A computer program product embodied on a non-transitory computer readable medium, comprising:
computer code for:
(a) generating photons and query locations;(b) determining a bounding volume of the query locations;(c) determining a set of the photons inside of the bounding volume;(d) determining whether the set of photons and the query locations meet a threshold including a number of query locations;(e) in response to a determination that the set of photons and the query locations meet the threshold including the number of query locations, computing a contribution of the set of photons to the query locations; and(f) in response to a determination that the set of photons or the query locations do not meet the threshold including the number of query locations:
partitioning the query locations; andfor each set of query locations resulting from the partitioning, repeating (b)-(f); wherein the computer program product is operable such that the query locations are partitioned according to a predetermined algorithm; wherein the computer program product is operable such that the predetermined algorithm includes sorting the query locations by x-axis, y-axis, and z-axis and partitioning the query locations according to a median of the sorted query locations.