An advancing front Delaunay triangulation algorithm designed for robustness

Abstract 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 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 that are 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.

[1]  P. Roe,et al.  A frontal approach for node generation in Delaunay triangulations , 1992 .

[2]  Shahyar Pirzadeh,et al.  Recent progress in unstructured grid generation , 1992 .

[3]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1991, SMA '91.

[4]  Shahyar Pirzadeh,et al.  Structured background grids for generation of unstructured grids by advancing front method , 1991 .

[5]  Marshal L. Merriam,et al.  An efficient advancing front algorithm for Delaunay triangulation , 1991 .

[6]  Paul-Louis George,et al.  Fully automatic mesh generator for 3D domains of any shape , 1990, IMPACT Comput. Sci. Eng..

[7]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[8]  Paresh Parikh,et al.  A package for unstructured grid generation and finite element flow solvers , 1989 .

[9]  O. C. Zienkiewicz,et al.  Adaptive remeshing for compressible flow computations , 1987 .

[10]  L. Paul Chew,et al.  Constrained Delaunay triangulations , 1987, SCG '87.

[11]  Timothy J. Baker,et al.  Three dimensional mesh generation by triangulation of arbitrary point sets , 1987 .

[12]  Arne Maus,et al.  Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

[13]  Tohru Ogawa,et al.  A new algorithm for three-dimensional voronoi tessellation , 1983 .

[14]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[15]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[16]  J. M. Nelson.  A triangulation algorithm for arbitrary planar domains , 1978 .

[17]  Charles L. Lawson,et al.  Transforming triangulations , 1972, Discret. Math..