Compressed Random-Access Trees for Spatially Coherent Data

Lefebvre, Sylvain; Hoppe, Hugues

Compressed Random-Access Trees for Spatially Coherent Data

Files

339-349.pdf (1.4 MB)

Date

2007

Authors

Lefebvre, Sylvain
Hoppe, Hugues

Publisher

The Eurographics Association

Abstract

Adaptive multiresolution hierarchies are highly efficient at representing spatially coherent graphics data. We introduce a framework for compressing such adaptive hierarchies using a compact randomly-accessible tree structure. Prior schemes have explored compressed trees, but nearly all involve entropy coding of a sequential traversal, thus preventing fine-grain random queries required by rendering algorithms. Instead, we use fixed-rate encoding for both the tree topology and its data. Key elements include the replacement of pointers by local offsets, a forested mipmap structure, vector quantization of inter-level residuals, and efficient coding of partially defined data. Both the offsets and codebook indices are stored as byte records for easy parsing by either CPU or GPU shaders. We show that continuous mipmapping over an adaptive tree is more efficient using primal subdivision than traditional dual subdivision. Finally, we demonstrate efficient compression of many data types including light maps, alpha mattes, distance fields, and HDR images.

        @inproceedings{:10.2312/EGWR/EGSR07/339-349
,
booktitle = {Rendering Techniques
},
editor = {Jan Kautz and Sumanta Pattanaik
},
title = {{Compressed Random-Access Trees for Spatially Coherent Data
}},
author = {Lefebvre, Sylvain and 
Hoppe, Hugues
},
year = {2007
},
publisher = {The Eurographics Association
},
ISSN = {1727-3463
},
ISBN = {978-3-905673-52-4
},
DOI = {/10.2312/EGWR/EGSR07/339-349
}
}