Directed Acyclic Graph Encoding for Compressed Shadow Maps
| dc.contributor.author | Scandolo, Leonardo | en_US |
| dc.contributor.author | Eisemann, Elmar | en_US |
| dc.contributor.editor | Binder, Nikolaus and Ritschel, Tobias | en_US |
| dc.date.accessioned | 2021-07-05T07:47:47Z | |
| dc.date.available | 2021-07-05T07:47:47Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | 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. | en_US |
| dc.description.sectionheaders | Compression | |
| dc.description.seriesinformation | High-Performance Graphics - Symposium Papers | |
| dc.identifier.doi | 10.2312/hpg.20211283 | |
| dc.identifier.isbn | 978-3-03868-156-4 | |
| dc.identifier.issn | 2079-8687 | |
| dc.identifier.pages | 53-59 | |
| dc.identifier.uri | https://doi.org/10.2312/hpg.20211283 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/hpg20211283 | |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.3.7 [Computer Graphics] | |
| dc.subject | Three Dimensional Graphics and Realism | |
| dc.subject | Color | |
| dc.subject | shading | |
| dc.subject | shadowing | |
| dc.subject | texture | |
| dc.title | Directed Acyclic Graph Encoding for Compressed Shadow Maps | en_US |