Abstract

Rendering complex scenes with indirect illumination, high dynamic range environment lighting, and many direct light sources remains a challenging problem. Prior work has shown that all these effects can be approximated by many point lights. For hundreds of thousands of lights, a brute force solution that computes all columns of the many-lights problem is prohibitively expensive. Many methods have been proposed to reduce the computation complexity of the many-lights problem. In this paper, We introduce three different many light algorithms which exploit matrix structure from different aspects. The advantage and disadvantage are analyzed according to different aspects of three algorithms.

Full Text
Paper version not known

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 call