3D Delaunay mesh generation coupled with an advancing-front approach

Computer Methods in Applied Mechanics and Engineering

Volumn 157, Issue 1-2, 1998, Pages 115-131

  Frey, Pascal J ^a   Borouchaki, Houman ^a   George, Paul Louis ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS;

DELAUNAY METHOD;

COMPUTATIONAL FLUID DYNAMICS;

EID: 0032048737     PISSN: 00457825     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7825(97)00222-3     Document Type: Article

References (19)

1. [1] D.J. Mavriplis, Unstructured mesh generation and adaptivity, ICASE report #95-26, Apr 1995.
2. [2] S. Rebay, Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer/Watson algorithm, 3rd Int. Conf. on Numerical Grid Generation in Comp. Fluid Dyn., Barcelona, Spain, June 1991.
3. [3] J.D. Müller, P.L. Roe and H. Deconinck, A frontal approach for node generation in Delaunay triangulations, Unstructured grid methods for advection dominated flows, VKI Lecture notes, pp. 9-1-9-7, AGARD Publication R-787, March 1992.
4. [4] D.L. Marcum and N.P. Weatherill, Unstructured grid generation using iterative point insertion and local reconnection, AIAA J. 33(9) (1995) 1619-1625.
5. [5] M.L. Merriam, An efficient advancing front algorithm for Delaunay triangulation, AIAA paper 91-0792, January 1991.
6. [6] E. Brière de l'Isle and P.L. George, Optimization of tetrahedral meshes, I. Babuska, W.D. Henshaw, J.E. Oliger, J.E. Flaherty, J.E. Hopcroft and T. Tezduyar, eds., 75 (1995) 97-128.
7. [7] H. Borouchaki, P.L. George, F. Hecht, P. Laug and E. Saltel, Delaunay mesh generation governed by metric specifications. Part I: Algorithms, Finite Elements Anal. Des., 25 (1997) 61-83.
8. [8] P.L. George, Automatic mesh generation. Application to Finite Element Methods (Wiley, 1991).
9. [9] F. Hermeline, Triangulation automatique d'un polyèdre en dimension N, R.A.I.R.O. Analyse Num. 3 (1986) 231-246.
10. [10] A. Bowyer, Computing Dirichlet tessellations, Comput. J. (1991) 162-169.
11. [11] D.F. Watson, Computing the n-dimensional Delaunay tesselation with application to Voronoï polytopes, Comput. J. 24 (1981) 167-172.
12. [12] P.L. George and F. Hermeline, Delaunay's mesh of a convex polyhedron in dimension d. Application for arbitrary polyhedra, Int. J. Numer. Methods Engrg. 33 (1992) 975-995.
13. [13] H. Borouchaki, P.L. George and S.H. Lo, Optimal Delaunay point insertion, Int. J. Numer. Methods Engrg., 39 (1996) 3407-3437.
14. [14] T.J. Baker, Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation, Engrg. Comput. 5 (1989) 161-175.
15. [15] J. Peraire, J. Peiro, L. Formaggia, K. Morgan and O.C. Zienkiewicz, Finite element Euler computations in three dimensions, Int. J. Numer. Methods Engrg. 26 (1988) 2135-2159.
16. [16] R. Löhner and P. Parikh, Three-dimensional grid generation by the advancing-front method, Int. J. Numer. Methods Fluids 8 (1988) 1135-1149.
17. [17] D.J. Mavriplis, An advancing front Delaunay triangulation algorithm designed for robustness, ICASE report #92-49, October 1992.
18. [18] V.N. Parthasarathy, C.M. Griachen and A.F. Hathaway, A comparison of tetrahedron quality measures, Finite Element Anal. Des. 15 (1993) 255-261.
19. [19] S.H. Lo, Automatic mesh generation and adaptation by using contours, Int. J. Numer. Methods Engrg. 31 (1991) 689-707.