A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Mesh Smoothing Algorithms for Complex Geometric Domains
[chapter]
2009
Proceedings of the 18th International Meshing Roundtable
Whenever a new mesh smoothing algorithm is introduced in the literature, initial experimental analysis is often performed on relatively simple geometric domains where the meshes need little or no element size grading. Here, we present a comparative study of a large number of well-known smoothing algorithms on triangulations of complex geometric domains. Our study reveals the limitations of some well-known smoothing methods. Specifically, the optimal Delaunay triangulation smoothing and weighted
doi:10.1007/978-3-642-04319-2_11
dblp:conf/imr/ErtenUZ09
fatcat:2rskd2jnqjgoda5uu54glgkue4