Abstract
Mesh generation techniques are widely employed in various engineering fields including those related to physical models described by partial differential equations. This paper describes the two-dimensional Delaunay triangulation procedure consisting of mesh generation, node creation, mesh smoothing, and adaptive remeshing technique. The proposed algorithm can generate mesh of arbitrary geometry for both simply connected and multi-boundary domains. The technique generates an entirely new mesh based on the solution obtained from simulation using the previous finite element/finite volume meshes; such that elements in regions with large changes of solution gradients become smaller and elements in areas with little changes of solution gradients grow larger. Finally, the performance of the proposed unstructured triangular mesh regeneration procedures are evaluated on both simply- and multi-connected boundaries domain of computational mechanics problems.
Mesh generation techniques are widely employed in various engineering fields including those related to physical models described by partial differential equations. This paper describes the two-dimensional Delaunay triangulation procedure consisting of mesh generation, node creation, mesh smoothing, and adaptive remeshing technique. The proposed algorithm can generate mesh of arbitrary geometry for both simply connected and multi-boundary domains. The technique generates an entirely new mesh based on the solution obtained from simulation using the previous finite element/finite volume meshes; such that elements in regions with large changes of solution gradients become smaller and elements in areas with little changes of solution gradients grow larger. Finally, the performance of the proposed unstructured triangular mesh regeneration procedures are evaluated on both simply- and multi-connected boundaries domain of computational mechanics problems.
Keywords: Triangular mesh, Delaunay triangulation, Error estimation
