Fast marching method: Difference between revisions

Revision as of 15:36, 3 July 2009

Revision as of 21:55, 17 January 2010

Line 7:

The algorithm is similar to [[Dijkstra's_algorithm|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|level set methods]]. More general algorithms exist but are normally slower.

Extensions to non-flat (triangulated) domains solving:

::<math>F(x)|\nabla_S T(x)|=1,

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

</math>

was introduced by [[Ron Kimmel]] and Sethian.

<gallery>

Line 15 ⟶ 23:

==External links==

* [http://math.berkeley.edu/~sethian/ The Fast Marching Method and its Applications by James A. Sethian]

* [http://www.cs.technion.ac.il/~ron/ Fast Marching on surfaces at Ron Kimmel's homepage]

* [http://mecca.louisville.edu/~msabry/projects/msfm.htm Multi-Stencils Fast Marching Methods]

* [http://www.mathworks.com/matlabcentral/fileexchange/24531 Multi-Stencils Fast Marching Matlab Implementation]