Optimal Surface Smoothing as Filter Design

Abstract

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.

Cite

Text

Taubin et al. "Optimal Surface Smoothing as Filter Design." European Conference on Computer Vision, 1996. doi:10.1007/BFB0015544

Markdown

[Taubin et al. "Optimal Surface Smoothing as Filter Design." European Conference on Computer Vision, 1996.](https://mlanthology.org/eccv/1996/taubin1996eccv-optimal/) doi:10.1007/BFB0015544

BibTeX

@inproceedings{taubin1996eccv-optimal,
  title     = {{Optimal Surface Smoothing as Filter Design}},
  author    = {Taubin, Gabriel and Zhang, Tong and Golub, Gene H.},
  booktitle = {European Conference on Computer Vision},
  year      = {1996},
  pages     = {283-292},
  doi       = {10.1007/BFB0015544},
  url       = {https://mlanthology.org/eccv/1996/taubin1996eccv-optimal/}
}