Constraint terrain parallel construction method under single-computer multi-core environment

Abstract

The invention discloses a constraint terrain parallel construction method under a single-computer multi-core environment, which comprises the steps of quad-edge structure based CD-TIN data structure and main function design, load balanced based data partition strategy, divide-and-conquer algorithm based subnet parallel construction, subnet parallel merging, grid index construction, constraint point ground object parallel insertion, constraint line ground object parallel insertion, and constraint surface ground object parallel insertion. A requirement for efficient terrain construction of common users is met by bringing parallel computing technologies into to full play, and more powerful experience is brought for the common users. On the basis of the prior art, an appropriate constraint terrain memory description data structure is designed, a database storage model corresponding to the constraint terrain memory description data structure is constructed, and a load balance strategy based discrete point data partition strategy is further provided; a divide-and-conquer algorithm is selected to act as a basic algorithm for terrain construction, a parallel insertion rule for constraint point ground objects, constraint line ground objects and constraint surface ground objects is formulated under the support of a space index technology, and a parallel insertion algorithm is designed.

Description

technical field [0001] The invention belongs to the technical fields of surveying and mapping and geographic information, and relates to a parallel construction method of constrained terrain in a single-machine multi-core environment. Background technique [0002] Triangulation can be traced back to the 1930s. It was proposed by the famous Russian mathematician Delaunay in 1934 to solve numerical analysis problems. However, the generation algorithm at that time was not mature. It has been greatly developed and applied in the late 1900s, and now many Delaunay triangulation algorithms have been accepted and adopted by people. According to the realization process, Tsai divided the subdivision algorithm into three categories, namely divide and conquer algorithm, point-by-point insertion method and triangular network growth method. In addition, most of the subsequent research is based on the improvement of these three types of algorithms in two ways. One is to continue to improv...

AI Technical Summary

Problems solved by technology

[0022] 1. The parallel construction of existing technologies is based on the cluster mode. For ordinary users, the cost is too high, which increases economic costs and is difficult for individuals to bear. The cluster mode is mainly to meet those departments and scientific research units that have needs. The main is the current popular multi-core independent CPU computer

[0023] 2. The existing parallel construction technology of triangular network is mainly oriented to the construction of unconstrained D-TIN, but for the construction of constrained D-TIN in a parallel environment, there are more problems to be considered, and the algorithm is more complicated, so it is difficult accomplish

[0025] 4. In the design of parallel computing algorithms, the use of databases to realize data storage is not considered. The data are all calculated in memory, which consumes a lot of memory, and it is difficult to support the parallel construction of massive data.

Images