Method for constructing Delaunay triangulation network

Abstract

The invention provides a method for constructing a Delaunay triangulation network. The method comprises the following steps of: reading discrete two-dimensional data; traversing the discrete two-dimensional data, taking a dynamic rectangular bounding box containing all discrete points as a convex hull, and constructing an initial triangulation network; sorting the discrete points, and deleting repeated discrete points; based on an insertion point hybrid positioning algorithm, taking points from the sorted discrete points in turn and inserting the points into an initial triangulation network toconstruct a continuously optimized triangulation network; and after all discrete points are inserted, deleting triangles related to the vertexes of the dynamic rectangular bounding box to obtain a target Delaunay triangulation network. Therefore, the insertion point positioning efficiency can be obviously improved, the efficiency is not easily influenced by the increase of data points, the insertion point is quickly and stably positioned to the target triangle, and the Delaunay triangulation network construction speed is greatly improved.

Description

technical field [0001] The invention relates to the field of information technology processing, in particular to a method for constructing a Delaunay triangular network. Background technique [0002] Triangulation is one of the important research contents in the field of computational geometry, and because of the advantages of simple data structure, low redundancy and high efficiency, as well as the property of maximizing the minimum angle and empty circumcircle, triangulation is widely used in geographic information systems, Digital elevation interpolation, geometric reconstruction and other fields have a wide range of applications. [0003] Delaunay triangulation is mainly used in the direct subsection algorithm. Compared with the direct triangulation algorithm, it is simpler, takes less memory, and is more suitable for the construction of a triangulation network with a large amount of data. For the direct Delaunay triangulation algorithm, there are mainly three kinds: t...

AI Technical Summary

Problems solved by technology

Because the Delaunay triangulation algorithm uses a point-by-point insertion method, the algorithm will judge the positional relationship between the insertion point and the current triangle, and continuously search to reach the target triangle. As the number of points increases, the point positioning speed will be greatly affected.

[0005] Through the research and analysis of existing insertion point positioning algorithms, it is found that some algorithms do not preprocess a large number of data points, and the overall positioning efficiency is not very high; Calculation of the center of gravity of the triangle has caused a certain degree of time consumption; some algorithms search for paths that are not unique, and some algorithms solve the situation that the path is not unique but are not the best path

Images