碩士 / 國立海洋大學 / 資訊科學學系 / 91 / Recently, minimal-cost path algorithms with turn penalties and obstacles in 2D mesh and transportation networks based on the modified Dijkstra algorithm by Ahuja and Kirby’s concept was presented with O(N) of time and space complexities, where N is the number of non-obstacle nodes. The thesis applied the concept of predecessors with additional monotonic buckets data structure to obtain the minimal-cost paths of 3-dimentional mesh and transportation networks with the same complexities.
These new algorithms have been coded in C++ language on personal computer with an Intel P4 1.3 GHz processor running MS Windows 2000, and some illustrations are presented as well.
| Identifer | oai:union.ndltd.org:TW/091NTOU0394014 |
| Date | January 2003 |
| Creators | 曹國權 |
| Contributors | 詹景裕 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 35 |
Page generated in 0.0063 seconds