Quick generation of unstructured grid

The Delaunay triangulation method for the generation of unstructured grid is analyzed and an efficient algorithm is developed by optimization. The dynamic data structure of double link list is used to speed up the process of grid generation. With this method, the general design purpose of the program is achieved and time needed for the grid generation is shortened considerably. Only one fifth of the time is needed in the new approach. At the same time the shape of the grid is quite well. This algorithm can be applied to treat arbitrary complicated domain and the grid can be refined easily.