Translator Disclaimer
4 January 1995 Finding shortest paths on surfaces by fast global approximation and precise local refinement
Author Affiliations +
Proceedings Volume 2356, Vision Geometry III; (1995)
Event: Photonics for Industrial Applications, 1994, Boston, MA, United States
Finding the shortest path between points on a surface is a challenging global optimization problem. It is difficult to devise an algorithm that is computationally efficient, locally accurate and guarantees to converge to the globally shortest path. In this paper a two stage coarse to the fine approach of finding shortest paths is suggested. In the first stage a fast algorithm is used to obtain an approximation to the globally shortest path. In the second stage the approximation is refined into a locally optimal path. In the first stage we use the fast algorithm introduced by Kiryati and Szekely that combines a 3-D length estimator with graph search. This path is then refined to a shorter geodesic curve by an algorithm that deforms an arbitrary initial curve ending at two given surface points via geodesic curvature shortening flow. The 3D curve shortening flow is transformed into an equivalent 2D one that is implemented using an efficient numerical algorithm for curve evolution with fixed end points, introduced by Kimmel and Sapiro.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ron Kimmel and Nahum Kiryati "Finding shortest paths on surfaces by fast global approximation and precise local refinement", Proc. SPIE 2356, Vision Geometry III, (4 January 1995);


Back to Top