###### Abstract  
Wind energy resources in complex terrain are abundant. However, the default mesh division of various terrains often needs more specificity, particularly in wind resource analysis. The mesh division method can diminish computational efficiency and quality in intricate topographical conditions. This article presents a combined algorithm for generating Delaunay triangular meshes in mountainous terrains with significant variations in terrain. The algorithm considers the uncertainty of inner nodes and mesh quality, addressing both the advantages and drawbacks of the Delaunay triangular mesh. The proposed method combines the triangular center of gravity insertion algorithm with an incremental inserting algorithm. Its main goal is to enhance the quality and efficiency of mesh generation, specifically tailored for this type of complex terrain. The process involves discretizing boundary edges and contour lines to obtain point sets, screening boundary triangles, and comparing the triangle area to the average boundary triangle area, combining with the incremental inserting algorithm to generate a triangular mesh of complex terrain. After an initial debugging of the mesh, it is determined whether increasing the internal nodes is necessary to insert the triangle centers of gravity. Upon implementing actual mountainous terrain in the simulation software, a comparison of the resulting meshing demonstrates that the proposed method is highly suitable for complex mountainous terrain with significant variations in elevation. Additionally, it effectively improves the quality of the Delaunay triangular mesh and reduces the occurrence of deformed cells during the meshing process. Delaunay triangulated irregular network; incremental inserting algorithm; triangular center of gravity insertion method; complex terrain; mesh quality Article  
5 January 2  
it will significantly extend the calculation time. [PERSON], when analyzing the wind resources of wind farms by applying the wind resource software Meteordyn WT, mentions that the default mesh division of the WT software is simple in the defined mapping area. It has the universality of all-terrain, but this mesh division will significantly reduce the complex terrain's calculation efficiency and mesh quality. So, it is necessary to research the more applicable mesh division method for complex terrain [1]. Among many types of meshing, a Delaunay triangulated irregular network (D-TIN) has a simple data structure and miniature storage space, is easy to update, and adapts to multiple point distribution methods. It is commonly employed to characterize the topographical features of the Earth's surface. It has found extensive application in mesh demarcation, the development of digital elevation models, and three-dimensional visualization. In 1908, [PERSON] first mathematically limited each discrete point's effective range of action and defined the Voronoi diagram on the two-dimensional plane. In 1934, [PERSON] evolved the Delaunay triangular network from the Voronoi diagram, which is easier to analyze and apply [2], as shown in Figure 1.  
In recent years, the formation of the Delaunay triangular mesh has garnered significant study interest and attention from scholars both domestically and internationally and classified this research into three primary algorithms: the partition method, the incremental inserting algorithm, and the growth algorithm. Among them, the triangular network growth algorithm could be more efficient, with less room for improvement. The partition algorithm is highly efficient, but the operation process occupies a large amount of memory due to recursion. It must deal with a manageable amount of data. The incremental inserting algorithm approach consumes less memory and is suitable for dealing with extensive data. However, when the number of triangles grows more and more, the process of point localization and local optimization procedure (LOP) optimization becomes slower. Operation efficiency cannot be guaranteed.