We are more than happy to reference the paper by F. Qin et al. Both their paper and the “fast marching” method build on Dijkstra's famous 1959 method for finding minimal costs and shortest paths in weighted networks. Dijkstra's approach introduces the idea of expanding wavefronts to build a running cost outwards from a starting point, and introduces much of the stardard terminology in such algorithms, including the ideas of accepting smallest values in the expanding fronts and building solutions outwards in steps from these smallest values (see Dijkstra, E. W., “A note on two problems in connection with graphs,”...

You do not currently have access to this article.