Shortest Path Search for Must-Pass Nodes Using Thiessen Polygons
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional shortest path search methods for must-pass nodes in computer graphics and geographic information science are inefficient and inaccurate, particularly when dealing with complex sample data, as they fail to consider spatial location information and sequential optimization.
Innovation Solution
The method involves constructing Thiessen polygons and Denaulay triangles around must-pass nodes, merging adjacent polygons, and connecting edge lines to find the shortest path, ensuring only two adjacent merged polygons exist, except at the start and end nodes, and handling self-intersecting lines by merging polygons.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional shortest path search methods are used, then the search process is simple, but the search efficiency and accuracy are not satisfactory
Solution Approach 1:
The patent divides the search space into multiple Thiessen polygons based on must-pass nodes, then further segments each polygon into a grid of smaller cells. This segmentation allows the algorithm to process complex spatial relationships by breaking them down into manageable units, improving search efficiency while maintaining manageable algorithm complexity through systematic division of the problem.
Solution Approach 2:
The patent introduces a new dimensional approach by constructing Thiessen polygons and grid cells in two-dimensional space, then using depth-first search to explore the three-dimensional relationship between polygons. This dimensional transformation enables the algorithm to handle spatial complexity more effectively, achieving better search performance without proportionally increasing computational complexity.
2Measurement precision
If traditional path search methods are used, then the implementation is simple, but the geographic information of spatial location is ignored
Solution Approach 1:
The patent assigns different properties to different regions by creating Thiessen polygons centered on must-pass nodes, where each polygon represents a specific spatial zone. The grid cell structure within each polygon allows for localized processing and precise spatial relationship analysis. This local quality approach enables the algorithm to accurately capture geographic information and spatial relationships without requiring the entire system to handle maximum complexity at once.
3Reliability
If sample data complexity comes to a certain level, then the data represents real-world conditions, but the shortest path search becomes difficult to figure out
Solution Approach 1:
The patent performs preliminary actions by pre-processing the must-pass nodes to construct Thiessen polygons and grid cells before executing the actual path search. This preliminary structuring of the spatial data into standardized polygons and cells simplifies the subsequent search process. By preparing the data structure in advance, the algorithm can handle complex real-world datasets more reliably and stably, reducing computational complexity during the actual path finding operation.
Data Source
AI summary
The present disclosure discloses a method for searching the shortest path of must-pass node, which includes the following processing steps: S1, constructing a Thiessen polygon; S2, when start node of must-pass nodes and end node of must-pass node are not the same must-pass node, performing processing of S3; S3, starting from the Thiessen polygon where the start node of must-pass nodes is located, querying the adjacent Thiessen polygons and merging them into the first merged polygon; S4, based on the first merged polygon, querying the unprocessed adjacent Thiessen polygons to merge the second merged polygon; S5, merging the isolated Thiessen polygon into a certain adjacent merged polygon with common edge; S6, deleting the edge lines of two vertices in Denaulay triangle that are not in the same merged polygon; S7. if the node degree of the remaining edge lines in the merged polygon is not greater than or equal to three, then proceed to S8; S8, connecting the edge lines of each merged polygon end-to-end, and the shortest connection line is the result. The present disclosure can effectively reduce the processing difficulty, cost and time, and improve the search efficiency.