期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2017
卷号：95
期号：18
页码：4446
出版社：Journal of Theoretical and Applied
摘要：We can use a Dijkstra algorithm to calculate shortest paths on a polygon mesh. However, if the number of vertices of a polygon mesh is large, the efficiency of conventional path searching method that using Dijkstra algorithm is low. In order to solve this problem, this paper proposes a method to search shortest distance and path by using the A* algorithm. According to an experiment with the bunny model with 2,503 vertices, the efficiency of searching the shortest path is improved approximately 80% than conventional methods.
