Path-finding method for optimal path

Abstract

The invention provides a optimal path searching method. It creates typological chart made of spot and lines of the scenic spot, computing the initial shortest path of the designated two points in the typological chart, with the initial shortest path being formed by serial passed spots and lines, sequentially judging the direct linear arrival from the start point of the initial shortest path to the continuous spots, till the farthest spot away from the start point, and judging whether the farthest spot is the final point or not, if not, regarding the farthest point as the start point and return to execute this step, otherwise, sequentially connecting two points between them as the optimal path output. It provides a smooth treatment for the shortest path, substituting the zigzag path by the line reachable path, representing the shortest path optimization, improving the activeness of the user.

Description

Technical field [0001] The invention relates to a method for calculating a path, in particular to a method for finding the optimal path between any two points in a two-dimensional or three-dimensional grid. Background technique [0002] In two-dimensional and three-dimensional computer games, there are many scenes, such as houses, corridors in houses, the earth, ocean, etc. The computer describes these scenes in the form of grids, that is, a scene is composed of several adjacent The grid is composed of triangles as the basic grid. In two-dimensional or three-dimensional space, any triangle can be determined as long as the coordinates of three vertices are given. Especially in three-dimensional games, the computer system can save the scene by saving the three-dimensional coordinates of the three vertices of the triangle. Therefore, no matter how complicated a scene is, it is composed of a number of triangular meshes with different shapes. How many triangle meshes a scene is divide...

AI Technical Summary

Problems solved by technology

[0010] However, the shortest path calculated by the above method has the following disadvantages: since the entire scene is composed of several triangular meshes of different shapes, even if there is no obstacle blocking between two points, it can be reached in a straight line, then, through the above-mentioned method The shortest path calculated by some methods still needs to pass through the midpoints of several triangular meshes in sequence, so the shortest path will appear zigzag. Therefore, in a two-dimensional or three-dimensional computer game, when the player makes an object from When moving from one point to another point, even if there is no obstacle in the middle to reach it in a straight line, the shortest path taken by the object is a winding line, which does not reflect the optimality of the shortest path and makes the player experience bad. , affecting user enthusiasm for using

Images