DocumentCode
786246
Title
Finding shortest paths on surfaces using level sets propagation
Author
Kimmel, Ron ; Amir, Arnon ; Bruckstein, Alfred M.
Author_Institution
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
Volume
17
Issue
6
fYear
1995
fDate
6/1/1995 12:00:00 AM
Firstpage
635
Lastpage
640
Abstract
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
Keywords
computational geometry; curve fitting; differential geometry; minimisation; bivariate function; equal distance curve tracking; height values; level sets propagation; rectangular grid; surface shortest path finding; Euclidean distance; Geophysics computing; Level set; Mobile robots; Motion planning; Navigation; Path planning; Remotely operated vehicles; Robot motion; Shock waves;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.387512
Filename
387512
Link To Document