|
|
|
| Mesh smoothing with vertex tolerance constraints |
| CHEN Ren-jie, LIU Li-gang, DONG Guang-chang |
| Department of Mathematics, Zhejiang University, Hangzhou 310027,China |
|
|
|
Abstract In order to make the mesh smoothing algorithms preserve the data precision and avoid dealing with the details of the models as noises and removing them, while relocating the positions of the vertices to remove the noise, a novel approach was presented for smoothing triangular meshes which guarantees that each vertex in the result does not exceed a given distance tolerance from its original position. The problem was formulized as a quadratic optimization with a set of nonlinear constraints, and a reliable iterative linear solution was proposed to solve the optimization. The new algorithm can also preserve the sharp features in the result by integrating feature constraints in the optimization. Many experimental results on both scanned models and synthetic models showed that the proposed algorithm can remove all the noise while preserving the features of the original model.
|
|
Published: 01 September 2010
|
|
|
严格顶点约束的网格光顺算法
为了使网格光顺算法在优化网格顶点以消除噪声同时，保持原始数据的精度，避免模型细节当作噪声而去除，给出一种用于三角网格光顺的新算法,该算法保证光顺结果中每个顶点距离其原始位置不超过给定偏差范围.将此光顺问题转化为带有一组非线性约束的二次优化问题,并提出一种有效的迭代线性求解方法用于其优化.算法也可以通过在优化中结合特征约束来更好地保护模型的精细特征.在大量扫描模型和人工合成模型上进行了实验,结果显示：算法可以有效消除所有噪声,同时保持原始模型的特征．
|
|
| ［1］ FIELD D A. Laplacian smoothing and Delaunay triangulations［J］. Communications in Applied Numerical Methods, 1987, 4（6）: 709712 ．
［2］ TAUBIN G. A signal processing approach to fair surface design［C］∥Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques. New York: ACM, 1995: 351358．
［3］ DESBRUN M, MEYER M, SCHRUDER P, et al. Implicit fairing of irregular meshes using diffusion and curvature flow［C］∥Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques. New York, ACM, 1999: 317324．
［4］ 刘胜兰, 周儒荣, 聂军洪, 等. 主曲率均匀的网格光顺［J］. 计算机学报, 2004, 27: 7984．
LIU Shenglan, ZHOU Rurong, NIE Junhong, et al. Mesh smoothing using principal curvature flow［J］. Chinese Journal of Computers, 2004, 27:7984．
［5］ 胡事民, 来煜坤, 杨永亮. 基于曲率流的四边主导网格的光顺算法［J］. 计算机学报, 2008, 31: 16221628．
HU Shiming, LAI Yikun, YANG Yongliang. A curvature flow based fairing algorithm of quaddominant meshes［J］. Chinese Journal of Computers, 2008, 31: 16221628．
［6］ KOBBELT L, CAMAGNA S, VORSATZ J, et al. Interactive multiresolution modeling on arbitrary meshes［C］∥Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques. New York, ACM, 1998: 105114．
［7］ 刘新国, 鲍虎军, 彭群生. 多边形网格的平滑除噪声算法［J］. 自然科学进展, 2000, 08: 746750 ．
LIU Xinguo, BAO Hujun. PENG Qunsheng. A smoothing and denoising polygonal mesh algorithm［J］. Progress in Natural Science, 2000, 08: 746750．
［8］ BAJAJ C L, XU G. Anisotropic diffusion of surfaces and functions on surfaces［J］. ACM Trans Graph, 2003, 22(1): 432 ．
［9］ CLARENZ U, DIEWALD U, RUMPF M. Anisotropic geometric diffusion in surface processing［C］∥Proceedings of the Conference on Visualization ’00. Salt Lake City, Utah, United States：［s.n.］,2000．
［10］ HILDEBRANDT K, POLTHIER K. Anisotropic filtering of nonlinear surface features［J］. Computer Graphics Forum, 2004, 23: 391400．
［11］ FLEISHMAN S, DRORI I, COHENOR D. Bilateral mesh denoising［C］∥ACM SIGGRAPH 2003 Papers. San Diego, California:［s.n.］, 2003．
［12］ PENG J, STRELA V, ZORIN D. A simple algorithm for surface denoising［C］∥Proceedings of the Conference on Visualization ’01. San Diego, California:［s.n.］,2001．
［13］ LIU L, TAI CL, JI Z, et al. Noniterative approach for global mesh optimization［J］. Comput Aided Des, 2007, 39(9): 772782．
［14］ HILDEBRANDT K, POLTHIER K. Constraintbased fairing of surface meshes［C］∥Proceedings of the Fifth Eurographics Symposium on Geometry Processing. Barcelona, Spain:［s.n.］, 2007．
［15］ KERSEY S N. On the problems of smoothing and nearinterpolation［J］. Mathematics Computation, 2003, 72: 18731885．
［16］ LAI YK, ZHOU QY, HU SM, et al. Robust Feature Classification and Editing［J］. IEEE Transaction on Visualization and Computer Graphics, 2007, 13:3445． |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
