Hamiltonian path rapid solving method based on TIN triangular network

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 a TIN triangular network. The method comprises the steps of S1 obtaining node sample data; S2 constructing Thiessen polygons and the TIN triangular network according to the node sample data; S3 extracting the outermost side boundaryof the TIN triangular network as an initial boundary, searching triangles sharing the same point with the initial boundary, combining search results to obtain a ring, searching triangles sharing thesame 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 combiningthe plurality of polygons into one polygon, wherein the combined polygon is the solution of the Hamiltonian path. The rapid Hamiltonian path solving method based on the TIN triangular network 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 solving method for a Hamiltonian path based on a TIN triangle network. Background technique [0002] Solving the Hamiltonian path problem is an NP problem, and humans have not yet found an effective solution to the polynomial problem. But this problem is not only a research hotspot in mathematics and computer graphics, but also a thinking problem that is difficult to break through in the human cognition world. This technology has great application potential in various fields related to space, including virtual computer space, etc., but the traditional Hamiltonian path problem method mostly seeks to solve it from a mathematical point of view, and its efficiency and scope of application are greatly limited. When the sample data reaches a certain amount when solving the ring, computers and traditional algorithms will be powerless. A simple...

AI Technical Summary

Problems solved by technology

This problem is a connection problem, which belongs to a one-dimensional space problem, and the samples of this problem are expanded in a two-dimensional environment, so the solution of this problem has a dimensional upgrade that is difficult to leapfrog, and the traditional solution is powerless

Images