Two-dimensional adaptive advancing front mesh generation
Yi Liang
Abstract
Yi Liang
Abstract
A two-dimensional adaptive triangulation algorithm based on geometric features of problem boundaries is proposed.Boundary curves are discretized firstly with curvatures and adjacencies considered,and the latter are calculated using the skeleton property of the constrained Delaunay triangulation.Then a modified Advancing Front Technique(AFT) is used to generate well graded meshes inside problem domains conforming to adaptive boundary discretization results.Some procedures are finally integrated to enhance mesh quality further.Mesh examples demonstrate that the algorithm can produce computing meshes with high element and gradation quality.
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.
A two-dimensional adaptive triangulation algorithm based on geometric features of problem boundaries is proposed.Boundary curves are discretized firstly with curvatures and adjacencies considered,and the latter are calculated using the skeleton property of the constrained Delaunay triangulation.Then a modified Advancing Front Technique(AFT) is used to generate well graded meshes inside problem domains conforming to adaptive boundary discretization results.Some procedures are finally integrated to enhance mesh quality further.Mesh examples demonstrate that the algorithm can produce computing meshes with high element and gradation quality.
Key concepts: Delaunay triangulation, Discretization, Polygon mesh, Triangulation, Surface triangulation, Volume mesh, Mesh generation, Boundary (topology)