Article ID: | iaor19981328 |
Country: | United States |
Volume: | 17 |
Issue: | 6 |
Start Page Number: | 635 |
End Page Number: | 640 |
Publication Date: | Jun 1995 |
Journal: | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Authors: | Amir A., Kimmel R., Bruckstein A.M. |
We present a new algorithm for determining minimal length paths between two regions on a three-dimensional surface. The numerical implementation is based on finding equal geodesic distance contours from a given area. These contours are calculated as zero sets of a bivariate function designed to evolve so as to track the equal distance curves on the given surface. The algorithm produces all paths of minimal length between the source and destination areas on the surface given as height values on a rectangular grid.