A framework for advancing front techniques of finite element mesh generation

Advancing front techniques are a family of methods for finite element mesh generation that are particularly effective in dealing with complicated boundary geometries. In the first part of this paper, conditions are presented which ensure that any planar aft algorithm that meets these conditions terminates in a finite number of steps with a valid triangulation of the input domain. These conditions are described by specifying a framework of subtasks that can accommodate many aft methods and by prescribing the minimal requirements on each subtask that ensure correctness of an algorithm that conforms to the framework.An important efficiency factor in implementing an aft is the data structure used to represent the unmeshed regions during the execution of the algorithm. In the second part of the paper, we discuss the use of the constrained Delaunay triangulation as an efficient abstract data structure for the unmeshed regions. We indicate how the correctness conditions of the first part of the paper can be met using this representation. In this case, we also discuss the additional requirements on the framework which ensure that the generated mesh is a constrained Delaunay triangulation for the original boundary.

[1]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[2]  Paresh Parikh,et al.  Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .

[3]  T. Y. Yang,et al.  A curved quadrilateral element for static analysis of shells with geometric and material nonlinearities , 1985 .

[4]  Paresh Parikh,et al.  Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .

[5]  Raimund Seidel,et al.  On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra , 1989, SCG '89.

[6]  Zhou Keding,et al.  Computing constrained triangulation and Delaunay triangulation: a new algorithm , 1990 .

[7]  Robert J. Renka,et al.  A constrained two-dimensional triangulation and the solution of closest node problems in the presence of barriers , 1990 .

[8]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[9]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[10]  R. B. Simpson.  Anisotropic mesh transformations and optimal error control , 1994 .

[11]  L. Chew.  Constrained Delaunay Triangulations (eng) , 1989 .

[12]  P. L. George,et al.  Automatic Mesh Generation: Application to Finite Element Methods , 1992 .

[13]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[14]  S. H. Lo,et al.  Delaunay triangulation of non‐convex planar domains , 1989 .

[15]  Ralf Tilch.  Unstructured grids, adaptive remeshing and mesh generation for Navier-Stokes , 1990 .

[16]  Philippe A. Tanguy,et al.  Efficient data structures for adaptive remeshing with the FEM , 1990 .

[17]  Philip L. Roe,et al.  A frontal approach for node generation in Delaunay triangulations , 1992 .

[18]  H. Fuhring,et al.  The application of node-element rules for forecasting problems in the generation of finite element meshes , 1975 .

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

[20]  Unstructures grids for the compressible Navier-Stokes equations : or CFD with less contraints , 1991 .

[21]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[22]  C. Börgers.  Generalized delaunay triangulations of non-convex domains , 1990 .

[23]  A. Bykat,et al.  Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons , 1976 .

[24]  Marie-Gabrielle Vallet.  Génération de maillages éléments finis anisotropes et adaptatifs , 1992 .

[25]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .