No algorithm for unconstrained polygon mesh denoising can beat Laplacian smoothing in simplicity and ease of imple-mentation. In this paper we introduce a new algorithm for polygon meshes smoothing with vertex position and face normal interpolatory constraints composed of two phases. First the face normals are filtered independently of vertex positions. Then the vertex positions are filtered integrating the face normals in the least squares sense. Laplacian smoothing is used to smooth both the face normal field and the vertex positions, with a properly defined Laplacian operator in each case. We define isotropic, anisotropic, linear, and non-linear Laplacian operators for signals defined in Euclidean space, and on the unit sphere. In addition to the obvious applications to shape design, our algorithm constitutes a new fast and linear solution to the tangential drift problem, observed in meshes with irregular edge length and angle distribution. We show how classical linear filter design techniques can be applied in both cases, and conclude the paper determining integrability conditions for face normal fields.
By: Gabriel Taubin
Published in: RC22213 in 2001
LIMITED DISTRIBUTION NOTICE:
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 .