Hamiltonian path quick search method based on TIN

Abstract

The invention relates to the field of computer graphics and geographic information science, and particularly discloses a Hamiltonian path quick search method based on a TIN, which comprises the following steps: S1, acquiring node sample data; S2, constructing a Thiessen polygon and TIN triangle network according to the node sample data; S3, extracting the outmost edge line of the TIN triangular network as a starting boundary, searching triangles which share the same point with the starting boundary, combining search results to obtain a ring, searching triangles which share the same point with the inner boundary of the ring, and repeating the search process until the whole TIN triangular network is searched; S4, judging whether all node degrees are 2 or not; and S5, combining a plurality of polygons into one polygon, wherein the combined polygon is the search result of the Hamiltonian path. The Hamiltonian path rapid searching method based on the TIN is simple in principle, the processing difficulty, cost and time can be effectively reduced, and the solving efficiency is improved.

Description

technical field [0001] The invention relates to the fields of computer graphics and geographic information science, in particular to a fast search method for a Hamiltonian path based on a TIN triangle network. Background technique [0002] The Hamiltonian path was proposed by the astronomer William Rowan Hamilton to find a path that passes through all other cities exactly once from a given start point to a given end point in a map network with multiple cities. [0003] The traveling salesman problem, namely the TSP problem (Traveling Salesman Problem) is also translated as the traveling salesman problem and the salesman problem. It is one of the famous problems in the field of mathematics. Assuming that a traveling merchant wants to visit N cities, he must choose the path he wants to take. The limit of the path is that each city can only be visited once, and in the end he must return to the original starting city. The goal of path selection is that the required path distanc...

AI Technical Summary

Problems solved by technology

[0008] Although the research on the Hamiltonian path problem has made some progress in the era of parallel computing, in view of the fact that the traditional algorithm only optimizes the combination of nodes sequentially, without in-depth consideration of the problem space relationship, so few scholars in the current research have discovered this problem Hidden space constraints are used for path search to prevent the amount of computation from spreading exponentially, so as to reduce the difficulty, cost and time of processing

Images