“Polynomial wavelet trees for bidirectional texture functions” by Baril, Boubekeur, Gioia and Schlick

  • ©Jerome Baril, Tamy Boubekeur, Patrick Gioia, and Christophe Schlick

Conference:


Type(s):


Title:

    Polynomial wavelet trees for bidirectional texture functions

Session/Category Title:   Measurement & Textures


Presenter(s)/Author(s):



Abstract:


    Polynomial Wavelet Tree is a new compression scheme for BTFs, based on separation of directional and spatial variations. Textures (spatial variations) are decomposed using wavelets, and the resulting light-dependent coefficients are fitted on a polynomial approximation. The method is suitable for rendering on GPU.

References:


    1. Filip, J., and Haindl, M. 2004. Non-linear reflectance model for bidirectional texture function synthesis. In ICPR ’04, IEEE Computer Society, vol. 1, 80–83.
    2. Heidrich, W., and Seidel, H.-P. 1998. View-independent environment maps. In HWWS ’98, ACM, New York, NY, USA, 39–ff.
    3. Malzbender, T., Gelb, D., and Wolters, H. 2001. Polynomial texture maps. In SIGGRAPH ’01, ACM, New York, NY, USA, 519–528.
    4. Meseth, J., Müller, G., and Klein, R. 2004. Reflectance field based real-time, high-quality rendering of BTF. Computers & Graphics 28, 1, 105–112.


ACM Digital Library Publication:



Overview Page: