Optimal Surface Smoothing as Filter Design

Smooth surfaces are approximated by polyhedral surfaces for a number of computational purposes. An inherent problem of these approximation algorithms is that the resulting polyhedral surfaces appear faceted. Within a recently introduced signal processing approach to solving this problem [7, 8], surface smoothing corresponds to low-pass filtering. In this paper we look at the filter design problem in more detail. We analyze the stability properties of the low-pass filter described in [7, 8], and show how to minimize its running time. We show that most classical techniques used to design finite impulse response (FIR) digital filters can also be used to design significantly faster surface smoothing filters. Finally, we describe an algorithm to estimate the power spectrum of a signal, and use it to evaluate the performance of the different filter design techniques described in the paper.

[1]  R. Courant,et al.  Methods of Mathematical Physics , 1962 .

[2]  H. Helms,et al.  Nonrecursive digital filters: Design methods for achieving specifications on frequency response , 1968 .

[3]  Ralph Roskies,et al.  Fourier Descriptors for Plane Closed Curves , 1972, IEEE Transactions on Computers.

[4]  Harry Dym,et al.  Fourier series and integrals , 1972 .

[5]  E. Seneta Non-negative matrices;: An introduction to theory and applications , 1973 .

[6]  Eugene Seneta,et al.  Non‐Negative Matrices , 1975 .

[7]  Alan V. Oppenheim,et al.  Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  R. Hamming Digital filters (3rd ed.) , 1989 .

[10]  Gabriel Taubin,et al.  Curve and surface smoothing without shrinkage , 1995, Proceedings of IEEE International Conference on Computer Vision.

[11]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.