DescriptionMesh smoothing is the process of relocating mesh vertices with the goal of improving various quality metrics such as minimum angle, maximum angle and aspect ratio. This thesis presents a study of computationally efficient smoothing methods applied to triangle and tetrahedral meshes. It has been known in the meshing literature that mesh smoothing is more efficient when vertex relocation is accompanied by the edge flipping operation in order to maintain Delaunay properties. While flipping in 2D is simple and proven to be effective, flipping in 3D does not give such guarantees. In this comparative study, we implement four algorithms for triangular and tetrahedral meshing with immediate
flipping. While immediate flipping has been mentioned in the mesh smoothing literature, it lacks experimental data, particularly for tetrahedral meshes. We compare these four methods in terms of speed, quality and grading of the mesh.