Tiled light trees

Yuriy O’Donnell¹, Matthäus G. Chajdas²

Accepted to ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games 2017

Abstract

Handling many light sources in real-time is still one of the big challenges in real-time graphics. Even the most recent approaches like practical clustered shading still have various problem cases with low performance. Especially in scenes with high depth variance, existing algorithms cannot adapt to the distribution of light sources properly and end up evaluating many lights that don’t contribute to the final image.

We present a new approach, “tiled light trees” - a hierarchical acceleration structure that adapts to the light source distribution. Our approach improves on the worst case performance of existing solutions. Due to traversal overhead, the proposed algorithm can be sometimes slower than clustered shading. To handle those situations optimally, we propose a hybrid approach which combines the strengths of light trees with clustered shading, outperforming any individual solution in nearly every case. Our new hybrid algorithm is easy to implement and suitable for usage in real-time applications such as games.

Download

BibTex

@inproceedings{
    O'Donnell:2017:TLT:3023368.3023376,
    author = {O'Donnell, Yuriy and Chajdas, Matth\"{a}us G.},
    title = {Tiled Light Trees},
    booktitle = {Proceedings of the 21st ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games},
    series = {I3D '17},
    year = {2017},
    isbn = {978-1-4503-4886-7},
    location = {San Francisco, California},
    pages = {1:1--1:7},
    articleno = {1},
    numpages = {7},
    url = {http://doi.acm.org/10.1145/3023368.3023376},
    doi = {10.1145/3023368.3023376},
    acmid = {3023376},
    publisher = {ACM},
    address = {New York, NY, USA},
    keywords = {culling, lighting, real-time},
}