Computation of Irradiance from Triangles by Adaptive Sampling

Simple item page
dc.contributor.authorUrena, C.en_US
dc.date.accessioned2015-02-16T07:04:45Z
dc.date.available2015-02-16T07:04:45Z
dc.date.issued2000en_US
dc.description.abstractWe introduce an algorithm for sample positioning in a planar triangle, which can be used to make numerical integration of an arbitrary function defined on it. This algorithm has some interesting properties which make it suitable for applications in the context of realistic rendering. We use an adaptive triangle partitioning procedure, driven by an appropriate measure of the error. The underlying variance is shown to be bounded, and in fact it can be controlled, so that it approaches the minimum possible value. We show results obtained when applying the method to irradiance computation, in the context of final-gather algorithms. We also describe a C++ class which offers all required functionality, and we made available its source code.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume19en_US
dc.identifier.doi10.1111/1467-8659.00452en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages165-171en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00452en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleComputation of Irradiance from Triangles by Adaptive Samplingen_US
Files
Collections
Issue 2