The shortest path from shortest distance on a polygon mesh

Abstract

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. © 2005 - Ongoing JATIT & LLS.