Preliminary Discussion on the Refinement Mesh Generation for Adaptive Analysis

In recent years, due to the rapid development of computer hardware and the urgent need of complex engineering problems, great support has been provided in the related fields of unstructured mesh generation. A large number of research results show that the adaptive analysis is an effective way to improve the efficiency and precision of the numerical calculation. The reliable error estimation and the powerful mesh generation are two key problems in the process of adaptive numerical analysis. H-type refinement strategy adding the new nodes in the high error area, gradually refines the mesh to reduce the size of the element to achieve the purpose of mesh adaptation; this strategy is simple, intuitive and easy to program. Although the calculation accuracy of unstructured triangle and tetrahedron elements is not high, these elements are suitable for discretization of any complex problem domain, and have a wider range of application in academic and engineering fields.


Introduction
Mesh generation is the process of dividing the continuous geometric domain into a number of discrete sub-domains, which is the key part of numerical analysis method. The mesh used for scientific computation can be divided into two categories; one is structured mesh; the other is unstructured mesh [1]. According to the engineering needs, different types of elements can be used in different parts of the same physical model, which can spend the least calculation cost and get the highest calculation accuracy. The automatic mesh generation tool with high performance is indispensable in the process of adaptive analysis, because *Corresponding author. robustness can solve complex problems and is currently limited to two-dimensional problems, because arbitrary three-dimensional mesh generation is still difficult to achieve [3].
The most important character of structured mesh is that there is a regular mapping relationship between nodes and grid elements; that is to say, the connection mode between each node and its adjacent nodes is fixed, and the connection information of each node can be obtained by calculating the node number, which makes structured grid generation relatively easy, but it can only be applied to models with relatively simple geometric structure. Two-dimensional quadrilateral element and three-dimensional hexahedron element are structured meshes. Unstructured mesh can be applied to the model with complex geometry structure, but its generation is more difficult and there is no mapping relationship between nodes and mesh elements. Triangles in 2D and tetrahedrons in 3D are all unstructured meshes.
Because tetrahedral meshes are usually regarded as triangular meshes in three-dimensional space, the study of triangulation techniques using both triangular and tetrahedral meshes is called triangulation techniques. One-dimensional simplex is a line segment, while two-dimensional and three-dimensional simplexes are triangles and tetrahedrons, respectively. Triangular mesh generation is the most flexible mesh generation method, which can automatically generate 2D and 3D models. Triangular meshes are more flexible than quadrilateral meshes and hexahedral meshes. Triangular and tetrahedral meshes can simulate any complex geometric model or complex boundary [4]. Although the computational accuracy of the quadrilateral and hexahedron elements is higher than that of the triangle and tetrahedron elements, it is difficult to generate quadrilateral and hexahedron meshes automatically for arbitrary 2D and 3D problems.

Delaunay Triangulation Algorithm
Delaunay triangulation was first proposed by the Russian mathematician Delaunay [5] in 1934, but it did not receive much attention at that time. Until the 1970s, with the great success of finite element method in more and more engi-

Lawson Algorithm
Lawson algorithm is a Delaunay triangulation algorithm based on vertex-by-vertex insertion and local edges swapping, which was first proposed by Lawson [6] in 1977. In 1989, Joe [7] designed a decision criterion based on space out ball, at the same time, extended the 2D Lawson algorithm based on edge exchange to the 3D Delaunay triangulation algorithm based on face exchange.
The Idea of the two dimensional Lawson algorithm is very simple, that is, through the diagonal exchange of all convex quadrilaterals formed by two triangles sharing sides in the mesh, the situation which does not meet the Delaunay triangulation standard in the mesh is eliminated, and it has been proved theoretically that for the triangulation of any point set. Both of them can transform the existing local non-Delaunay triangulation meshes into the Delaunay triangulation standard meshes by using finite number of diagonal transformations.
The basic idea of the two dimensional Lawson algorithm is as follows: 1) First, a set of initial Delaunay triangulation should be set up; 2) Generating a set of nodes to be inserted, after inserting new nodes, selecting a triangle containing the inserted new nodes, respectively connecting the vertices of the triangle and the newly inserted nodes in turn, and cutting the original triangle into three small triangles; 3) Testing the empty circumcircle criterion for the newly created three small triangles in turn, if the three small triangles can meet the empty circumcircle test, then jump to the second step to re-insert the next node; 4) If there is a circumcircle including nodes, we need to swap the diagonals of the quadrilateral to create two new triangles, and when all the newly created triangles meet the empty circumcircle criterion, we stop the edge swapping operation; 5) Perform the insertion circularly until the set of points to be inserted is empty, that is, all the nodes are inserted.
The whole process of Lawson edge switching algorithm is shown in Figure 1. After adding a new node in the initial mesh, the triangle initial mesh with general quality is generated, and the empty circumcircle criterion is detected for these triangles, and the diagonal exchange operation is performed for the triangles that do not meet the empty circumcircle criterion, which is exactly aimed at the triangle mesh with low quality and starts the optimization operation of edge exchange. The red lines in the figure are the diagonal lines that need to be changed. Replace the red diagonal lines with blue diagonal lines, and finally generate a better quality and conform to the Delaunay characteristics of the mesh.
The Lawson edge exchange algorithm aims at 2D triangulation, and extends to 3D problem, then exchanges the diagonal faces of tetrahedron. Considering that there are many kinds of construction methods of tetrahedron and the exchange Q. Tang, Y. Ren Journal of Applied Mathematics and Physics

The Bowyer-Waston Algorithm
The Bowyer-Waston algorithm is a new algorithm, which is the combination of the algorithms proposed by British scientist Bowyer [8] and Australian scientist Waston [9], respectively in 1981. It is based on the combination of the two algorithms. The specific implementation steps of Bowyer-Waston algorithm are as follows: 1) First, an initial Delaunay mesh is created; 2) The points to be inserted in the node set are sequentially inserted in the positions other than the initial grid nodes; 3)After the new nodes are inserted into the initial Delaunay mesh, the triangles whose circumcircle contains the new insertion point are found out respectively from the triangle chain list, and the common sides of these triangles which

The Dual Graph Voronoi Diagram Algorithm
Voronoi Diagram is a kind of graph composed of two-dimensional polygon or three-dimensional polyhedron, which is mainly used to study the problem of planar point set and its domain, proposed by Voronoi [10] in 1908, every point in the point set has a region satisfying certain conditions, which can be called Voronoi polygon. Voronoi polygons are pieced together to form a Voronoi diagram.

Q. Tang, Y. Ren Journal of Applied Mathematics and Physics
As shown in Figure 2(a), it is easy to see that each Voronoi polygon is similar to a cell, and that Voronoi diagram is a diagram contain a plurality of cells, each cell contain a red nucleus, and each cell, that is, the area related to the nucleus, is called Voronoi polygon or Voronoi element; A Delaunay triangulation can be obtained by connecting the red nuclei of two adjacent cells sharing a common edge with a blue solid line, and the red nuclei are the vertices of the triangulation, as shown in Figure 2(b). Delaunay triangulation is dual to Voronoi diagram, so we can obtain Delaunay triangulation by Voronoi diagram.
The Delaunay triangulation of 2D and 3D problems has something in common in many aspects. Therefore, most of the successful algorithms in 2D problems can be improved and applied to 3D problems, but there are some difficulties in the process of extending to 3D space both in theory and in practice.
Three-dimensional Delaunay triangulation is far from reaching the nearly perfect state of two-dimensional Delaunay triangulation, so far it is still the research focus of many researchers. The PLC (Piecewise Linear Complex) is used to describe the three-dimensional region which needs to be calculated, and the Piecewise Linear Complex is the expansion of the planar line graph from two-dimensional plane to three-dimensional space.

Mesh Generation
This paper introduces two high performance mesh generators based on Delaunay technology to generate unstructured mesh elements of triangle and tetrahedron. The 2D mesh code Triangle and 3D mesh code Tetgen are very suitable to be embedded into the main program of adaptive analysis simulation software.

Two Dimension
Triangle [11] is a robust 2D triangle mesh generator developed for Quake project by Professor Shewchuk of University of California, Berkeley, using standard C language. The Quake project is a tool that can simulate the propagation of energy during large-scale earthquakes, hoping to help reduce the loss of life and property in earthquake-prone countries and regions. It can be imagined that as an important part of the Quake project, Triangle with excellent mesh partition

Three Dimension
Tetgen [12] is an open source three-dimensional tetrahedral mesh generation

Mesh H-Type Refinement Strategy
In the iterative process of adaptive analysis, the new node information needed to be added can be obtained according to the calculation of the previous step, combined with the mesh information of the previous step, the mesh is reconstructed by using mesh subdivision code, and the new mesh after node refinement is generated, which can be used for the next calculation and analysis. For two-dimensional triangle element and three-dimensional tetrahedron element, this chapter respectively designed a simple and intuitive H-type mesh refinement strategy [15] [16], as shown in Figure 3 The refinement strategy of tetrahedron is carried out in two steps, as shown in

Conclusion
Adaptive analysis technique is an effective way to improve the efficiency and