In order to solve the problem of low computational efficiency in salt formation modeling, an improved algorithm based on Delaunay triangulation growth is proposed. Compared with the strengths and weaknesses of the ordinary Delaunay triangulation algorithm, we improve the efficiency of the algorithm from three aspects: firstly, the concept of closed-angle is applied; secondly, the positive and negative zone method is used to search for discrete points; finally the triangulation is constructed with the priority point as the center. In the process of generating Delaunay triangles, the search range of discrete points is gradually reduced to overcome the shortcomings of the low time efficiency of conventional algorithms. The experiment results show that the improved algorithm has better adaptability to the point set scale and higher network construction efficiency, and can be used for the construction of Delaunay triangulation in complex salt layer scenarios.