Realization of Shortest Path-Planning on Polygonal Surfaces
碩士 === 國立臺北大學 === 電機工程學系 === 103 === Most recently, Jan proposed an O(n) near-shortest path-planning algorithm based on the Rubik’s snake, Ahuja–Dijkstra algorithm, and ridge points in the polygonal surface and the implementation with experimental results are addresses in this thesis. The shortest p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33537733305070897784 |