The Planning of a 3D Shortest Path on a Raster Spatial Space
碩士 === 國立海洋大學 === 電機工程學系 === 88 === It is widely studied to find the shortest path of two points on a map. This means that the path will cost a minimum on time and distance. The Lee path connection algorithm, which proposed in 1961, is the most widely used method for finding wire paths on PCB and VL...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67091814981177488299 |