Automatic Generation of Finite Element Triangular Mesh for Arbitrarily Shaped Planar Regions
Pan Zi-jie
Abstract
Pan Zi-jie
Abstract
Based on the Delaunay triangulation method, this paper presents an automatic triangular mesh generation algorithm for arbitrarily shaped planar regions. This algorithm has the advantages of adaptation to complicate boundaries, high quality boundary mesh and full automation. Approaches such as topological refinement and smoothing are incorporated. The algorithm has been realized through redeveloping autoCAD by ARX. Great many examples are included to demonstrate the reliability and practicability of the algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the Delaunay triangulation method, this paper presents an automatic triangular mesh generation algorithm for arbitrarily shaped planar regions. This algorithm has the advantages of adaptation to complicate boundaries, high quality boundary mesh and full automation. Approaches such as topological refinement and smoothing are incorporated. The algorithm has been realized through redeveloping autoCAD by ARX. Great many examples are included to demonstrate the reliability and practicability of the algorithm.
Key concepts: Delaunay triangulation, Mesh generation, Planar, Smoothing, Finite element method, Automation, Boundary (topology), Computer science