Fast generation of unstructured mesh based on adjacency list

The generation of unstructured triangle/tetrahedral mesh is the precondition to solve the fluid flow and heat transfer in complex domain. It is of great importance to develop fast generation algorithm of unstructured mesh. According to the characteristics of Delaunay triangulation method, a fast algorithm to create unstructured mesh is proposed. In this method, triangle structure is presented by Graph and the data is stored by Adjacency List, through which the neighbor triangles can be easily found since their addresses are stored in each node. Meanwhile the time consuming of deletion, insertion and sorting operation can be saved considerably because of the property of list. Compared with the traditional algorithm based on structured array, the efficiency of the new algorithm to generate unstructured mesh can be improved dramatically. From the generated meshes, it is shown that with the new algorithm, not only the generation speed is increased, but also the quality of the mesh is better and easy to be refined. Finally, the generated mesh is smoothed by Laplace method and the mesh quality can be further improved.