Hamiltonian path rapid solving method based on adjacent rectangles

Abstract

The invention relates to the field of computer graphics and geographic information science, and particularly discloses a Hamiltonian path rapid solving method based on adjacent rectangles. The methodcomprises the steps of S1 obtaining node sample data; S2 constructing a minimum bounding rectangle of the node sample; S3 measuring the average close distance of the nodes; S4 dividing the minimum enclosing rectangle into a plurality of equal adjacent rectangles along a transverse axis or a longitudinal axis by taking integral multiples of the average adjacent distance as a reference; S5 sequentially connecting the nodes in each adjacent rectangle along the transverse axis direction or the longitudinal axis direction to form a connecting line; and S6 sequentially connecting the connecting lines of the adjacent rectangles to merge all the connecting lines into one connecting line, and taking the result as the solution of the Hamiltonian path. The Hamiltonian path rapid solving method basedon adjacent rectangles is simple in principle, can effectively reduce the processing difficulty, cost and time, and improves the solving efficiency.

Description

technical field [0001] The invention relates to the fields of computer graphics and geographic information science, in particular to a fast solving method for a Hamiltonian path based on adjacent rectangles. Background technique [0002] The fast path search method under the necessary nodes is the current research hotspot in the field of location services, and has great application potential in logistics, resource allocation, military and other fields. However, the traditional fast path search methods of necessary nodes are mostly carried out from the perspective of graph theory and mathematics, and their search efficiency and accuracy are not satisfactory. Moreover, when the number of sample data reaches a certain level in the traditional method of searching for the fastest path through the necessary nodes, the amount of calculation increases geometrically, and the traditional algorithm will be powerless. [0003] The method of searching for the fastest path through the ne...

AI Technical Summary

Problems solved by technology

However, in view of the geometric particularity of the search method for the fastest path of the necessary nodes, the optimal combination of the necessary nodes has not been deeply considered in terms of the spatial relationship, so few scholars use the traditional spatial relationship for the necessary nodes in the current research. Point the fastest path search field, prevent the amount of computation from spreading to the exponential level, and achieve the purpose of reducing the difficulty, cost and time of processing

Images