Fast marching method: Difference between revisions

Revision as of 03:35, 11 April 2017

Revision as of 03:45, 11 April 2017

Line 8:

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 method]]s. [[Eikonal equation#Computational algorithms|More general algorithms exist]] but are normally slower.

Extensions to non-flat (triangulated) domains solving:

::<math>|\nabla_S u(x)|=1 / f(x),

\,\, \mbox{for the surface} \,\, S, \, \mbox{and} \,\, x\in S.

</math>

wasfor the surface <math>S</math> and <math>x\in S</math>, were introduced by [[Ron Kimmel]] and [[James Sethian]].

<gallery>