Skip to Main content Skip to Navigation
Conference papers

Polynomial Wavelet Trees for Bidirectional Texture Functions

Jerome Baril 1, 2 Tamy Boubekeur 3 Patrick Gioia 4 Christophe Schlick 1, 2
1 IPARLA - Visualization and manipulation of complex data on wireless mobile devices
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : Polynomial Wavelet Tree is a new tool for accurate and efficient compression of BTFs. The key idea is to separate directional and spatial variations by projecting the spatial BTF domain (i.e., the light-dependent textures) onto a wavelet basis and to approximate these light-dependent wavelet coefficients with a polynomial function. Fitting wavelet coefficients instead of data themselves is a more efficient approximation compared to previous solutions since low frequency light transitions are smooth and higher frequency coefficients can be quantized with less importance. This wavelet projection and the light-dependent polynomial approximation is done for each view-point. Our solution is also designed for efficient high quality materials rendering on GPU.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00355359
Contributor : Jérôme Baril <>
Submitted on : Thursday, January 22, 2009 - 3:58:47 PM
Last modification on : Thursday, February 11, 2021 - 2:58:35 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:17:55 PM

File

PWT.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jerome Baril, Tamy Boubekeur, Patrick Gioia, Christophe Schlick. Polynomial Wavelet Trees for Bidirectional Texture Functions. ACM Siggraph 2008 - Talk Program, Aug 2008, Los Angeles, United States. ⟨10.1145/1401032.1401072⟩. ⟨inria-00355359⟩

Share

Metrics

Record views

311

Files downloads

416