HISTORY OF THE METHODS/FLOW CHART
ABOUT THE AUTHOR/CV
1996, 1999, 2006
Applications to Geodesics
with boundary condition that T=0 at A, then once an arrival time T is computed at the point B, one can trace backwards along the gradient nabla T to produce the shortest geodesic path. This is what is done in Ref. 1 below. We refer the reader to more details and examples of geodesic shortest paths.
New Book and Resource on Level Set and Fast Marching Methods