We show a simple proof of the existence of a path on the "border of water and rocks" based on combinatorial induction procedure and we present an algorithm for computing L, shortest path in "Fjord Scene...
详细信息
We show a simple proof of the existence of a path on the "border of water and rocks" based on combinatorial induction procedure and we present an algorithm for computing L, shortest path in "Fjord Scenery". The proposed algorithm is a version of the Dijkstra technique adapted to a rectangle map with a square network. A few pre-processing modifications of the algorithm following from the combinatorial procedure are included. The validity of this approach is shown by numerical calculations for an example. (C) 2003 Elsevier B.V. All rights reserved.
暂无评论