An advancing front Delaunay triangulation algorithm designed for robustnessA 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 variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh 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.
Document ID
19930040782
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Mavriplis, D. J. (NASA Langley Research Center Hampton, VA, United States)
Date Acquired
August 16, 2013
Publication Date
January 1, 1993
Subject Category
Computer Programming And Software
Report/Patent Number
AIAA PAPER 93-0671
Meeting Information
Meeting: AIAA, Aerospace Sciences Meeting and Exhibit