Merged Multiresolution Hierarchies for Shadow Map Compression

Journal article (2016)

Authors

L. Scandolo Computer Graphics and Visualisation -

P. Bauszat Computer Graphics and Visualisation -

E. Eisemann Computer Graphics and Visualisation -

Research Group

Computer Graphics and Visualisation () (TU Delft)

To reference this document use:

http://resolver.tudelft.nl/uuid:2f81e069-a1d7-4bd9-ab27-d587cf2ea094

More Info

expand_more

Published Date

2016

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Intelligent Systems

Research Group

Computer Graphics and Visualisation

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.