Fast marching method

Article summary

The fast marching method is a numerical method created by James Sethian for solving boundary value problems of the Eikonal equation: : |\nabla u(x)|=1/f(x) \text{ for } x \in \Omega : u(x) = 0 \text{ for } x \in \partial \Omega Typically, such a problem describes the evolution of a closed surface as a function of time u with speed f in the normal direction at a point x on the propagating surface. The speed function is specified, and the time at which the contour crosses a point x is obtained by solving the equation. Alternatively, u(x) can be thought of as the minimum amount of time it would take to reach \partial\Omega starting from the point x . The fast marching method takes advantage of this optimal control interpretation of the problem in order to build a solution outwards starting from the "known information", i.e. the boundary values. The algorithm is similar to Dijkstra's algorithm and uses the fact that information only flows outward from the seeding area. This problem is a special case of level-set methods. More general algorithms exist but are normally slower. Extensions to non-flat (triangulated) domains solving :: |\nabla_S u(x)|=1 / f(x), for the surface S and x\in S , were introduced by Ron Kimmel and James Sethian.…

Key claims

No claims recorded.

Discussion questions

1. Summarise the article in your own words. Which single claim would you verify first, and why?
2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.