|
Published Articles >> Table of Contents >> Abstract
11th Pacific Conference on Computer Graphics and Applications (PG'03)
p. 502
Butterworth Filtering and Implicit Fairing of Irregular Meshes
Hao Zhang, Simon Fraser University
Eugene Fiume, University of Toronto
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCCGA.2003.1238303
Send link to a friend
| Abstract |
|
In this paper, we propose efficient numerical techniques for Butterworth filtering and implicit fairing of large irregular triangle meshes, where the corresponding filters are rational polynomials and the resulting large linear systems need to be solved iteratively. We show that significant speed-up can be achieved for Butterworth filtering by factorizing the linear system in the complex domain. As for implicit fairing, with our estimate of the optimal extrapolation parameter ω, successive overrelaxation (SOR) offers great improvements, both in speed and space usage, over the more familiar conjugate gradient type solvers.
|
 Additional Information
|
Citation:
Hao Zhang, Eugene Fiume,
"Butterworth Filtering and Implicit Fairing of Irregular Meshes,"
pg,
p. 502,
11th Pacific Conference on Computer Graphics and Applications (PG'03),
2003
|
|
