Optimal Surface Smoothing as Filter Design

For a number of computational purposes, including visualization, smooth surfaces are approximated by polyhedral surfaces. An inherent problem of these approximation algorithms is that the resulting polyhedral surfaces appear faceted. A signal processing approach to smoothing polyhedral surfaces was recently introduced [10,11]. Within this framework surface smoothing corresponds to low-pass filtering. In this paper we look at the filter design problem in more detail. We anlayze the stability properties of the low-pass filter described in [10,11], and show how to minimize its running time. Then we show that most classical techniques used to design finite impulse response (FIR) digital filters can also be used to design significantly faster 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.

By: Gabriel Taubin, Tong Zhang (Stanford Univ.) and Gene Golub (Stanford Univ.)

Published in: RC20404 in 1996


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .