New Weights in Laplacian Smoothing on Triangular Mesh

Kawa M. A. Manmi

doi:10.25212/lfu.qzj.2.2.39

توێژەران

Kawa M. A. Manmi Mathematics Department, College of Science, Salahaddin University – Erbil, Iraq (Part time Lecturer at Lebanese French University)

##semicolon##

https://doi.org/10.25212/lfu.qzj.2.2.39

##semicolon##

triangular mesh, Laplacian smoothing, Weight factors, normal vector, discrete surface.

پوختە

Mesh smoothing is one of the basic procedures for improvement of mesh quality. Most smoothing techniques move vertices of the mesh without changing topology of the connectivity. Laplace smoothing is one of the simplest and efficient algorithm, where in each step vertex of the mesh is move to the barycenter of its neighbors. The only problem with Laplacian smoothing is surface shrinking when it is performed iteratively. In this paper, three relatively simple weights proposed in Laplacian smoothing which has less surface shrinking from the previous weights. The performance and effectiveness of the presented weights are
demonstrated on two knowing simply and doubly connected geometrical shapes respectively.

##plugins.generic.usageStats.downloads##

##plugins.generic.usageStats.noStats##

سەرچاوەکان

H. Gouraud, Continuous shading of curved surfaces. IEEE transactions on computers, 100(6), pp. 623-629, 1971

BT. Phong, Illumination for computer generated pictures. Communications of the ACM, 18(6), pp. 311-317, 1975.

G. Schaufler and H.W. Jensen, Ray tracing point sampled geometry. Proceedings of the Eurographics Workshop on Rendering Techniques 2000 pp. ( 319-328), 2013

J. Liu, Automatic triangulation of n-D domains, in Proceedings of the CAD/Graphics’91, pp. 238–241, Hangzhou, China, 1991.

E. A. Dari and G. C. Buscaglia, Mesh optimization: how to obtain good unstructured 3D finite element meshes with notso-good mesh generators, Structural Optimization, 8, (2-3), pp. 181–188, 1994.

P. L. George, Improvements on Delaunay-based three dimensional automatic mesh generator, Finite Elements in Analysis and Design, 25( 3-4) pp. 297–317, 1997.

J. Li and G. Lu, Mesh simplification and optimization with edge collapse and massspring model, Journal of Computer-Aided Design and Computer Graphics, 18(3), pp. 426–432, 2006.

N. Qin, X. Liu, and H. Xia, An efficient moving grid algorithm for large deformation, Modern Physics Letters B, 19 (28-29), pp. 1499–1502, 2005.

X. Liu, N. Qin, and H. Xia, Fast dynamic grid deformation based on Delaunay graph mapping,” Journal of Computational Physics, 211(2), pp. 405–423, 2006.

S. Sun, M. Zhang, and Z. Gou, Smoothing Algorithm for Planar and Surface Mesh Based on Element Geometric Deformation. Mathematical Problems in Engineering Volume 2015, Article ID 435648, 9.

Y. Ohtake, A. Belyaev and I. Bogaevski, Mesh regularization and adaptive smoothing. Computer-Aided Design, 33(11), pp.789-800, 2001.

T. DeRose, T. Duchamp, H. Hoppe, J. McDonald, and W. Stuetzle. Mesh optimization. In Proceedings of SIGGRAPH, pp. 19–26, 1993.

M. Gross and A. Hubeli. Fairing of nonmanifolds for visualization. In Proceedings of IEEE Visualization, pp. 407–414, 2000.

T. Gabriel. A signal processing approach to fair surface design. In Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, pp. 351- 358. ACM, 1995.