Method for searching shortest path of inevitable node

A search method and technology of the shortest path, applied to road network navigators, measuring devices, instruments, etc., to achieve huge application potential, improve search efficiency, and reduce the difficulty of processing

Active Publication Date: 2020-03-17
GUANGXI HUALAN GEOTECHNICAL ENG CO LTD
View PDF7 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in view of the particularity of the search method for the shortest path under the necessary nodes, the optimization combination of the necessary nodes and the geographical location information have not been considered in depth, so no scholars in the study have used the traditional path search method for the necessary nodes Lower the shortest path search field to reduce the difficulty, cost and time of processing

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for searching shortest path of inevitable node
  • Method for searching shortest path of inevitable node
  • Method for searching shortest path of inevitable node

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] Such as Figure 1-7 As shown, the present invention provides the present invention provides a search method for the shortest path of necessary nodes, which is realized by the center line of the path and the spatial topological relationship, and the search method is used for plane solution;

[0041] The method includes the following processing steps:

[0042] S1. Obtain each necessary node and construct a Thiessen polygon through each necessary node;

[0043] S2. Determine whether the starting point must pass through the node and the end point must pass through the same node, if not, directly perform S3 processing;

[0044] S3. Starting from the Thiessen polygon where the starting point must pass through the node, query the Thiessen polygon adjacent to the Thiessen polygon; then merge the adjacent Thiessen polygons in the adjacent Thiessen polygons into the first Merging the polygons and then performing S4 processing, if there are non-adjacent and isolated Thiessen pol...

Embodiment 2

[0056] like Figure 8-15 As shown, the difference between this embodiment and Embodiment 1 is that: in S2, if the starting node and the end point must pass the same node, it is the return mode, and the necessary node and the destination node All the necessary nodes are divided into two parts by the connection line between the necessary nodes with the farthest distance between the necessary nodes, and then S3 processing is performed on the two parts respectively. In this example, Figure 8-15 The upper left corner is the node that must pass through the starting point and the node that must pass through the end point. The processing process is to divide all the necessary nodes into two parts by connecting the necessary nodes farthest from the starting point and the necessary nodes farthest from the starting point, and carry out the processing of embodiment 1 on the two parts respectively to form two Connecting lines, connecting the corresponding ends of two connecting lines to...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for searching a shortest path of an inevitable node. The method comprises processing steps that S1, a Thiessen polygon is constructed; S2, if a starting point inevitable node and a terminal point inevitable node are not the same inevitable node, S3 is carried out; S3, adjacent Thiessen polygons are queried and combined to form a first combined polygon by taking theThiessen polygons where the starting point inevitable node is located as the starting point; S4, adjacent unprocessed Thiessen polygons are queried and combined to form a second combined polygon by taking the first combined polygon as a reference; S5, the isolated Thiessen polygons are combined into a certain combined polygon with adjacent common edges; S6, edges, which are not in the same combined polygon, of two vertexes in the Denaulay triangle are deleted; S7, if the condition that a node degree is greater than or equal to 3 does not exist in the remaining side lines in the combined polygon exists, S8 processing is carried out; and S8, side lines in each combined polygon are connected end to end, and the short connecting line is taken as a result. The method is advantaged in that processing difficulty, cost and time can be effectively reduced, and search efficiency is improved.

Description

technical field [0001] The invention belongs to the fields of computer graphics and geographic information science, and in particular relates to a search method for the shortest path of necessary nodes. Background technique [0002] The shortest path search method under necessary nodes is a research hotspot in mathematics and computer graphics, and has great application potential in logistics, resource allocation, military and other fields. However, the traditional search method of the shortest path under the necessary nodes is mostly carried out from the perspective of graph theory and mathematics, and its search efficiency and accuracy are not satisfactory, and the geographical information of the spatial position is ignored. In addition, when the complexity of the sample data reaches a certain level in the shortest path search method under the necessary nodes, computers and traditional algorithms will be powerless. [0003] The shortest path search method under the necess...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/34
CPCG01C21/3446G01C21/343
Inventor 卢玉南魏金占朱兆旻吴宁覃伟荣陆韦春陈明辉唐媛
Owner GUANGXI HUALAN GEOTECHNICAL ENG CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap