z-logo
Premium
Constrained Fairing for Meshes
Author(s) -
Liu Xinguo,
Bao Hujun,
Heng PhengAnn,
Wong TienTsin,
Peng Qunsheng
Publication year - 2001
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00483
Subject(s) - smoothing , polygon mesh , computer science , decimation , algorithm , representation (politics) , minification , mathematical optimization , mathematics , computer vision , filter (signal processing) , computer graphics (images) , politics , political science , law
In this paper, we present a novel fairing algorithm for the removal of noise from uniform triangular meshes without shrinkage and serious distortion. The key feature of this algorithm is to keep all triangle centers invariant at each smoothing step by including some constraints in the energy minimization functional. The constrained functional is then minimized efficiently using an iterative method. Further, we apply this smoothing technique to a multiresolution representation to remove arbitrary levels of detail. A volume‐preserving decimation algorithm is presented to generate the multiresolution representation. The experimental results demonstrate the combined algorithm's stability and efficiency.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here