Selective refinement: A new strategy for automatic node placement in graded triangular meshes

This is the authors' abstract. We don't add key points for this paper.

Automating triangular finite element mesh generation involves two interrelated tasks: generatine a distribution of well‐placed nodes on the boundary and in the interior of a domain, and constructing a triangulation of these nodes. For a given distribution of nodes, the Delaunay triangulation generally provides a suitable mesh, and Watson's algorithm 26 provides a flexible means of constructing it. In this paper, a new method is described for automating node placement in a Delaunay triangulation by seieclive refinement of an initial triangulation. Grading of the mesh is controlled by an explicit or implicit node spacing function. Although this paper describes the technique only in the planar context, the method generalizes to three dimensions as well.