The Delaunay triangulation is a fundamental problem in the field of computational geometry. It is widely used because of its excellent characteristics. To construct a Delaunay triangulation network efficiently and accurately on a large-scale point set

an improved Delaunay triangulation algorithm based on priority point is presented in this paper. An initial base edge is selected from the convex hull edges in anticlockwise order. A Delaunay triangle is constructed by base edge and the third point in the anticlockwise order

which maximizes the angle opposite the base edge. Whether the generated two edges need to be expanded is determined by the array of the needed expanded edges. The first-in-first-out strategy is used to extract the base edge from the array of the needed expanded edges. The local Delaunay triangulation is constructed around the priority point and accelerates the priority point to become a closed-point. Then

the closed-point is removed. The running time ratio of improved algorithm to classical algorithm is less than a third when using the same point set

and the ratio gradually decreases with increasing point set scale. Compared with the classical algorithm

the improved algorithm has significant enhancement in time efficiency. The improved algorithm has better adaptability for point set scale and high efficiency for constructing Delaunay triangulation. It can also be used for large-scale point set Delaunay triangulation.