In Proceedings of Conference on High-Performance Graphics

Directed acyclic graph encoding for compressed shadow maps

Leonardo Scandolo and Elmar Eisemann

Scenes used for our tests

Detailed shadows in large-scale environments are challenging. Our approach enables efficient detailed shadow computations for static environments at a low memory cost. It builds upon compressed precomputed multiresolution hierarchies but uses a directed acyclic graph to encode its tree structure. Further, depth values are compressed and stored separately and we use a bit-plane encoding for the lower tree levels entries in order to further reduce memory requirements and increase locality. We achieve between 20\% to 50\% improved compression rates, while retaining high performance.


More Information

Citation

Leonardo Scandolo and Elmar Eisemann, Directed acyclic graph encoding for compressed shadow maps, In Proceedings of Conference on High-Performance Graphics, pp. 53–59, 2022.

BibTex

@inproceedings{bib:scandolo:2022,
    author       = { Scandolo, Leonardo and Eisemann, Elmar },    
    title        = { Directed acyclic graph encoding for compressed shadow maps },
    booktitle    = { In Proceedings of Conference on High-Performance Graphics },
    year         = { 2022 },
    pages        = { 53--59 },
    publisher    = { Eurographics Association },
    organization  = { ACM },
    address      = { Goslar, DEU },
    doi          = { 10.2312/hpg.20211283 },
    url          = { https://publications.graphics.tudelft.nl/papers/338 },
}