Title: Automatic Mesh Generation by Delaunay Triangulation and Its Application to Remeshing
Abstract: An algorithm for automatic mesh generation of two-dimensional arbitrary planar domain is proposed by using Delaunay triangulation algorithm. An efficient algorithm is proposed for the construction of Delaunay triangulation algorithm over convex planar domain. From the definition of boundary, boundary nodes are first defined and then interior nodes are generated ensuring the Delaunay property. These interior nodes and the boundary nodes are then linked up together to produce a valid triangular mesh for any finite element analysis. Through the various example, it is found that high-quality triangular element meshes are obtained by Delaunay algorithm, showing the robustness of the current method. The proposed mesh generation scheme has been extended to automatic remeshing, which is applicable to FE analysis including large deformation and large distortion of elements.
Publication Year: 1996
Publication Date: 1996-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot