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: | HU, YING-MAO, 胡英懋 |
---|---|
Other Authors: | JAN, GENE-EU |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/33537733305070897784 |
Similar Items
-
Shortest path-planning on polygonal surfaces
by: Po-Yang Wu, et al.
Published: (2015) -
Shortest paths in weighted polygons.
by: Chénier, Christian.
Published: (2009) -
Single source shortest paths in simple polygons
by: Rodrigues, Mateus Barros
Published: (2019) -
Shortest path in a polygon using sublinear space
by: Sariel Har-Peled
Published: (2015-11-01) -
Mesh algorithms for shortest path problems inside simple polygons
by: Li, Shui-Cang, et al.
Published: (1992)