z-logo
open-access-imgOpen Access
Mesh smoothing algorithm based on exterior angles split
Author(s) -
Yongqing Hai,
Siyuan Cheng,
Yufei Guo,
Shaojing Li
Publication year - 2020
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0232854
Subject(s) - quadrilateral , polygon mesh , smoothing , laplacian smoothing , algorithm , mesh generation , triangle mesh , finite element method , convergence (economics) , volume mesh , computer science , offset (computer science) , scaling , transformation (genetics) , mathematics , topology (electrical circuits) , geometry , engineering , computer vision , structural engineering , combinatorics , chemistry , economics , gene , programming language , economic growth , biochemistry
Since meshes of poor quality give rise to low accuracy in finite element analysis and kinds of inconveniences in many other applications, mesh smoothing is widely used as an essential technique for the improvement of mesh quality. With respect to this issue, the main contribution of this paper is that a novel mesh smoothing method based on an exterior-angle-split process is proposed. The proposed method contains three main stages: the first stage is independent element geometric transformation performed by exterior-angle-split operations, treating elements unconnected; the second stage is to offset scaling and displacement induced by element transformation; the third stage is to determine the final positions of nodes with a weighted strategy. Theoretical proof describes the regularity of this method and many numerical experiments illustrate its convergence. Not only is this method applicable for triangular mesh, but also can be naturally extended to arbitrary polygonal surface mesh. Quality improvements of demonstrations on triangular and quadrilateral meshes show the effectiveness of this method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here