A character path search method for 3D games

Abstract

The invention provides a character path search method of a 3D game. The method comprises the steps that a character path navigation map of the 3D game is divided into a plurality of triangles; three sides of the triangle where a starting point is located are taken as three initial feasible search directions, overlapping search nodes are searched to find branch points, and the overlapping search nodes between every two adjacent branch points are saved as an overlapping search node set; if multiple paths exist between every two branch points, the shortest path is marked; the general direction ofa character path is determined; the path between an ending point and the starting point cannot be linear, the starting point, the shortest paths among the branch points and the ending point are sequentially connected, otherwise, the connecting line between the starting point and the ending point is the character path which is obtained by searching. According to the method, the whole character path navigation map is branched and marked in the search process, the related branch paths are searched for, spliced and combined into the final path, a ray principle is utilized for searching for inflection points, unnecessary nodes are not searched for or calculated, the search time is shortened, and the memory occupancy amount is reduced.

Description

Technical field [0001] The invention belongs to the technical field of digital media, and particularly relates to a character path search method for 3D games. Background technique [0002] As people's requirements for games continue to increase, 3D games occupy an increasingly important proportion of games. Compared with 2D games, 3D games are more realistic and more random in spatial manipulation. This means that 3D games have very high requirements on the computing speed and memory requirements of the graphics card. An important part of 3D games is automatic path finding. The algorithm used in automatic pathfinding takes a long time to calculate for complex terrain and occupies more memory. Not only that, but the same problem appears in dealing with dynamic obstacles. In this way, users may have long waiting times and unsmooth games in 3D games. Affected the quality of the game. [0003] Traditional 3D games use A* algorithm as the main implementation algorithm. A* algorith...

AI Technical Summary

Problems solved by technology

Therefore, although the search for the shortest path can be achieved, in 3D games, players are very unhappy about the long wait and the freezing of the screen, so the memory occupation and search speed are the focus of everyone's research

Images