APliant Method for Anisotropic Mesh Generation
Bossen, Frank, J. and Paul S. Heckbert
5th International Meshing Roundtable, Sandia National Laboratories, pp.63-76, October 1996
A new algorithm for the generation of anisotropic, unstructured triangular meshes in two dimensions is described. Inputs to the algorithm are the boundary geometry and a metric that specifies the desired element size and shape as a function of position. The algorithm is an example of what we call pliant mesh generation. It first constructs the constrained Delaunay triangulation of the domain, then iteratively smooths, refines, and retriangulates. On each iteration, a node is selected at random, it is repositioned according to attraction/repulsion with its neighbors, the neighborhood is retriangulated, and nodes are inserted or deleted as necessary. All operations are done relative to the metric tensor. This simple method generates high quality meshes whose elements conform well to the requested shape metric. The method appears particularly well suited to surface meshing and viscous flow simulations, where stretched triangles are desirable, and to time-dependent remeshing problems.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article