Abstract: 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.

Abstract: A maze-solving method includes converting extracted channel surface-shaped data into channel boundary lines; extending extension lines from two end points at a start point and at a terminal point, to two sides outside a maze, and constructing, outside the maze, a virtual connection line I and a virtual connection line II connecting base points on the extension lines of the start point and the terminal point; respectively enclosing a polygon I and a polygon II by means of the virtual connection line I and the channel boundary lines and by means of the virtual connection line II and the channel boundary lines, in which paths connecting the start point and the terminal point, between the polygon I and the polygon II are alternative solution paths for the maze; and selecting an alternative solution path with the shortest length as the optimal solution path for the maze.

Abstract: Provided is a maze solving method based on a line-surface spatial relation, comprises the following steps: A. extracting channel surface-shaped data; B. converting the channel surface-shaped data into channel boundary lines; C. respectively extending extension lines from the two endpoints of the start point along the two outer sides of the maze, respectively extending extension lines from the two endpoints of the terminal point along the two outer sides of the maze, a base point is provided on the extension line, at the outside of the maze, constructing a virtual connecting line I which connects the base point of the start point and the base point of the terminal point, constructing a virtual connecting line II which connects the base point of the start point and the base point of the terminal point; D.