Hamiltonian path searching method and system based on contour line thinking

Abstract

The invention relates to the field of computer graphics and geographic information science, and particularly discloses a Hamiltonian path searching method and system based on contour line thinking, and the method comprises the following steps: S1, obtaining node sample data; S2, constructing an outsourcing graph of a node sample; S3, constructing a Thiessen polygon by taking each node as a center to form a Thiessen polygon network; S4, searching a Thiessen polygon adjacent to the boundary line by taking the boundary line as a reference; S5, searching Thiessen polygons adjacent to the Thiessen polygon ring; S6, repeating the searching step in S5 until the searching result covers all the Thiessen polygons; S7, taking any node in one Thiessen polygon ring as a starting point, and sequentially connecting all nodes in the Thiessen polygon ring; and S8, repeating the connection step in the S7 to obtain a result. According to the Hamiltonian path searching method and system based on contour line thinking, the principle is simple, 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 Hamiltonian path search method and system based on contour line thinking. 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 distance...

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 spatial relationship of the problem, so few scholars in the current research have discovered the underlying problem of the problem. Containing space constraints and using them in path search to prevent the amount of computation from spreading exponentially, so as to reduce the difficulty, cost and time of processing

Images