Detailed Information
Cited 0 time in 
Cited 1 time in 
Cited 1 time in
Metadata Downloads
The shortest path from shortest distance on a polygon mesh
- Issue Date
- Sep-2017
- Publisher
- Asian Research Publishing Network
- Keywords
- A* algorithm; Dijkstra algorithm; Polygon mesh; Shortest distance; Shortest path
- Citation
- Journal of Theoretical and Applied Information Technology, v.95, no.18, pp.4446 - 4454
- Volume
- 95
- Number
- 18
- Start Page
- 4446
- End Page
- 4454
- ISSN
- 1992-8645
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > Global School of Media > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Oh, Kyoung su
- College of Information Technology (Global School of Media)