AN ADVANCING FRONT DELAUNAY TRIANGULATION ALGORITHM DESIGNED FOR ROBUSTNESS

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth var iation of elements, and the resulting triangulation constitutes the De launay triangulation of these points. The algorithm combines the mathe matical elegance and efficiency of Delaunay triangulation algorithms w ith the desirable point placement features, boundary integrity, and ro bustness that are traditionally associated with advancing-front-type m esh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail, regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field. (C) 1995 Academic Press, Inc.