Abstract
We 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
