Shortest Route on Height Map Using Gray-Level Distance Transforms
This article presents an algorithm for finding and visualizing the shortest route between two points on a gray-level height map. The route is computed using gray-level distance transforms, which are variations of the Distance Transform on Curved Space (DTOCS). The basic Route DTOCS uses the chessboard kernel for calculating the distances between neighboring pixels, but variations, which take into account the larger distance between diagonal pixels, produce more accurate results, particularly for smooth and simple image surfaces. The route opimization algorithm is implemented using the Weighted Distance Transform on Curved Space (WDTOCS), which computes the piecewise Euclidean distance along the image surface, and the results are compared to the original Route DTOCS. The implementation of the algorithm is very simple, regardless of which distance definition is used.
- 2.Ikonen, L., Toivanen, P., Tuominen, J.: Shortest Route on Gray-Level Map using Distance Transform on Curved Space. In: Proc. of Scandinavian Conference on Image Analysis, pp. 305–310 (2003)Google Scholar
- 11.Toivanen, P.J.: Convergence properties of the Distance Transform on Curved Space (DTOCS). In: Proc. of Finnish Signal Processing Symposium, pp. 75–79 (1995)Google Scholar