Call
The fast marching method is a numerical method created by James Sethian for solving boundary value problems of the Eikonal equation:
Typically, such a problem describes the evolution of a closed surface as a function of time u {\displaystyle u} with speed f {\displaystyle f} in the normal direction at a point x {\displaystyle x} on the propagating surface. The speed function is specified, and the time at which the contour crosses a point x {\displaystyle x} is obtained by solving the equation. Alternatively, u {\displaystyle u} can be thought of as the minimum amount of time it would take to reach ∂ Ω {\displaystyle \partial \Omega } starting from the point x {\displaystyle 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 domains solving
Talk Doctor Online in Bissoy App