The Near-Shortest Path Search on a Quadric Surface and Its Application
碩士 === 國立臺灣海洋大學 === 電機工程學系 === 101 === Recently, a new algorithm to obtain the sub-shortest path in the Euclidean plane based on the concepts of Delaunay triangulation, an improved Dijkstra algorithm and Fermat points was presented. The length of path obtained by this algorithm is the shortest among...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31731977630965509707 |