Next: About this document ...
Up: Extracting Curvilinear Features from
Previous: Conclusions
- 1
-
E. W. Dijkstra, ``A note on two problems in connection with graphs,'' Numerische Mathematik, vol. 1, pp. 269-271, 1959.
- 2
-
E. V. Denardo and B. L. Fox, ``Shortest route methods: 1. reaching, pruning and
buckets,'' Operations Research, vol. 27, no. 1, pp. 161-186, 1979.
- 3
-
D. van Vliet, ``Improved shortest path algorithms for transportation
networks,'' Transportation Research, vol. 12, pp. 7-20, 1978.
- 4
-
E. F. Moore, ``The shortest path through a maze,'' Proceedings of The
International Symposium on Theory of Switching, pp. 285-292, 1957.
- 5
-
U. Pape, ``Implementation and efficiency of moore - algorithms for the shortest
route problems,'' Mathematical Programming, vol. 7, pp. 212-222, 1974.
Mark Dobie
1999-03-04