- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Wavelet radiosity in computer graphics
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Wavelet radiosity in computer graphics Ziegler, Philipp
Abstract
The thesis presents an overview of the recent development of radiosity methods in computer graphics in a uniform mathematical framework. The focus is on hierarchical methods using wavelets. The thesis experimentally analyzes the behavior of higher-order wavelet bases in hierarchical methods. The functions applied are multiwavelets and a family of wavelets proposed by Cohen, Daubechies and Vial. The latter wavelets have overlapping support. Generally, we find that higher-order wavelet bases save memory compared to Haar wavelets, while they require more time for the computation. Furthermore, we investigate how Krylov subspace methods can be employed to solve the discrete system of equations arising in hierarchical methods. We show that the Generalized Minimal Residual method (GMRES) is advantageous compared to the usually employed Picard iteration.
Item Metadata
Title |
Wavelet radiosity in computer graphics
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1998
|
Description |
The thesis presents an overview of the recent development of radiosity methods in computer
graphics in a uniform mathematical framework. The focus is on hierarchical methods using
wavelets.
The thesis experimentally analyzes the behavior of higher-order wavelet bases in hierarchical
methods. The functions applied are multiwavelets and a family of wavelets proposed
by Cohen, Daubechies and Vial. The latter wavelets have overlapping support. Generally,
we find that higher-order wavelet bases save memory compared to Haar wavelets, while they
require more time for the computation.
Furthermore, we investigate how Krylov subspace methods can be employed to solve
the discrete system of equations arising in hierarchical methods. We show that the Generalized
Minimal Residual method (GMRES) is advantageous compared to the usually employed
Picard iteration.
|
Extent |
6627104 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-05-28
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051668
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1998-11
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.