3D anisotropic mesh refinement in compliance with a general metric specification

Abstract A simple and efficient anisotropic refinement procedure for the three-dimensional tetrahedral element mesh based on successive bisection of edges is proposed. Refinement is done by dividing lines of the mesh based on the lengths calculated on three points as specified by the metric tensor along the direction of the line. To obtain the best mesh quality, the subdivision of line segments is performed in the sequence according to the length of the line segments to be divided. Such an order of priority can be determined by a simple sorting process on all the line segments for which refinement is needed. This list of ordered line segments has to be updated from time to time to take into account the new line segments generated during the subdivision process. From the examples studied, the CPU time for mesh refinement seems to bear a linear relationship with the number of elements generated, with a refinement rate of up to 30 000 elements/s on an IBM Power Station 3BT. Shape optimization procedures can be applied to the refined mesh to further improve the quality of the elements. The refinement scheme is useful as part of a general three-dimensional mesh generation package, or as the mesh refinement module in an adaptive finite element analysis.

[1]  T. J. Baker,et al.  Developments and trends in three-dimensional mesh generation , 1989 .

[2]  A. Jack,et al.  Aspects of three‐dimensional constrained Delaunay meshing , 1994 .

[3]  P. George,et al.  Delaunay mesh generation governed by metric specifications. Part II. applications , 1997 .

[4]  Willem F. Bronsvoort,et al.  Finite-element mesh generation from constructive-solid-geometry models , 1994, Comput. Aided Des..

[5]  B. Joe,et al.  Relationship between tetrahedron shape measures , 1994 .

[6]  Bernard Chazelle,et al.  Triangulating a non-convex polytype , 1989, SCG '89.

[7]  A. Liu,et al.  On the shape of tetrahedra from bisection , 1994 .

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

[9]  Nigel P. Weatherill,et al.  Grid adaptation using a distribution of sources applied to inviscid compressible flow simulations , 1994 .

[10]  S. H. Lo,et al.  Automatic mesh generation and adaptation by using contours , 1991 .

[11]  Barry Joe,et al.  Quality Local Refinement of Tetrahedral Meshes Based on Bisection , 1995, SIAM J. Sci. Comput..

[12]  B. Joe.  Three-dimensional triangulations from local transformations , 1989 .

[13]  Rainald Löhner,et al.  Adaptive remeshing for transient problems , 1989 .

[14]  J. Z. Zhu,et al.  Effective and practical h–p‐version adaptive analysis procedures for the finite element method , 1989 .

[15]  P. George,et al.  Automatic mesh generator with specified boundary , 1991 .

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

[17]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[18]  C. Lee,et al.  A new scheme for the generation of a graded quadrilateral mesh , 1994 .

[19]  Dimitri J. Mavriplis,et al.  Adaptive mesh generation for viscous flows using delaunay triangulation , 1990 .

[20]  B. Joe.  Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions , 1994 .

[21]  R. D. Small,et al.  Numerical methods for partial differential equations based on power series , 1983 .

[22]  S. Lo.  Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach , 1991 .

[23]  Raimund Seidel,et al.  On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..

[24]  E. K. Buratynski.  A fully automatic three-dimensional mesh generator for complex geometries , 1990 .

[25]  C. Lee,et al.  An automatic adaptive refinement finite element procedure for 2D elastostatic analysis , 1992 .

[26]  N. Golias,et al.  An approach to refining three‐dimensional tetrahedral meshes based on Delaunay transformations , 1994 .

[27]  O. C. Zienkiewicz,et al.  Error estimation and adaptivity in flow formulation for forming problems , 1988 .

[28]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[29]  P. George,et al.  Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra , 1992 .

[30]  P. George,et al.  Delaunay mesh generation governed by metric specifications. Part I algorithms , 1997 .

[31]  M. Rivara.  Mesh Refinement Processes Based on the Generalized Bisection of Simplices , 1984 .

[32]  Josip Pečarić,et al.  Recent advances in geometric inequalities , 1989, Acta Applicandae Mathematicae.