Research on Route Reduction Method for Route Graph

Abstract

A route graph is used for route search in the game field, but the more routes there are, the longer the calculation time. For this reason, a method of obtaining the degree of importance, which serves as an index for reducing routes, has been proposed. However, when route graphs are generated in real time, it is important to shorten the calculation time of the route importance calculation method. In this research, we proposed and verified a method to quickly calculate the importance of a route from the length of the shortest route between vertices around the deleted route. When the proposed method is applied to multiple route graphs, it is possible to shorten the computation time and obtain the degree of importance close to that of the previous method for some route graphs.