Lightcut Interpolation

Hauke Rehfeld and Carsten Dachsbacher

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics 2016



    , author = {Hauke Rehfeld and Carsten Dachsbacher}
    , title = {Lightcuts Interpolation}
    , booktitle = {High Performance Graphics 2016}
    , series = {HPG2016}
    , year = {2016}
    , publisher = {ACM}
    , url = {}


Many-light rendering methods replace multi-bounce light transport with direct lighting from many virtual point light sources to allow for simple and efficient computation of global illumination. Lightcuts build a hierarchy over virtual lights, so that surface points can be shaded with a sublinear number of lights while minimizing error. However, the original algorithm needs to run on every shading point of the rendered image. It is well known that the performance of Lightcuts can be improved by exploiting the coherence between individual cuts. We propose a novel approach where we invest into the initial lightcut creation at representative cache records, and then directly interpolate the input lightcuts themselves as well as per-cluster visibility for neighboring shading points. This allows us to improve upon the performance of the original Lightcuts algorithm by a factor of 4‚ąí8 compared to an optimized GPU-implementation of Lightcuts,while introducing only a small additional approximation error. The GPU-implementation of our technique enables us to create previews of Lightcuts-based global illumination renderings.