Abstract
Multiresolution Hierarchies (MH) and Directed Acyclic Graphs (DAG) are two recent approaches for the compression of high-resolution shadow information. In this paper, we introduce Merged Multiresolution Hierarchies (MMH), a novel data structure that unifies both concepts. An MMH leverages both hierarchical homogeneity exploited in MHs, as well as topological similarities exploited in DAG representations. We propose an efficient hash-based technique to quickly identify and remove redundant subtree instances in a modified relative MH representation. Our solution remains lossless and significantly improves the compression rate compared to both preceding shadow map compression algorithms, while retaining the full run-time performance of traditional MH representations.
| Original language | English |
|---|---|
| Pages (from-to) | 383-390 |
| Number of pages | 8 |
| Journal | Computer Graphics Forum (online) |
| Volume | 35 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 2016 |
| Event | Pacific Graphics 2016: 24th Pacific Conference on Computer Graphics and Applications - Okinawa, Japan Duration: 11 Oct 2016 → 14 Oct 2016 |