| The accuracy of finite element analysis depends on the quality of the mesh the analysis acts upon. Many techniques for automatic mesh generation or for automatic mesh smoothing of preliminary meshes have been presented. One of the popular smoothing algorithms for 2D meshes is the Laplacian smoothing algorithm. However, it generates slivers and invalid elements in some cases. In Zhou and Shimada's [24] mesh smoothing algorithm, improvement on the Laplacian smoothing algorithm is obtained by optimizing a torsion spring system. Although Zhou and Shimada's algorithm involves an optimization process to change the mesh, the process does not optimally position the internal nodes of the new mesh.; In this thesis, we present a new 2D mesh smoothing algorithm that optimizes the new locations of all nodes. The algorithm's derivation and results from its application are presented here. |
