Finding shortest paths on surfaces using level sets propagation
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 17 (6) , 635-640
- https://doi.org/10.1109/34.387512
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
This publication has 13 references indexed in Scilit:
- Shortening three-dimensional curves via two-dimensional flowsComputers & Mathematics with Applications, 1995
- Estimating shortest paths and minimal distances on digitized three-dimensional surfacesPattern Recognition, 1993
- Implementing continuous-scale morphology via curve evolutionPattern Recognition, 1993
- Shape offsets via level setsComputer-Aided Design, 1993
- Computing interface motion in compressible gas dynamicsJournal of Computational Physics, 1992
- High-Order Essentially Nonoscillatory Schemes for Hamilton–Jacobi EquationsSIAM Journal on Numerical Analysis, 1991
- Feature-Oriented Image Enhancement Using Shock FiltersSIAM Journal on Numerical Analysis, 1990
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulationsJournal of Computational Physics, 1988
- Planning and reasoning for autonomous vehicle controlInternational Journal of Intelligent Systems, 1987
- Curvature and the evolution of frontsCommunications in Mathematical Physics, 1985