Fast marching method: Difference between revisions

Revision as of 20:32, 23 June 2009

Revision as of 20:57, 23 June 2009

Line 1:

The '''fast marching method''' is introduced by [[James Sethian|James A. Sethian]] as a numerical method for solving [[boundary
value problem | boundary value problems]] of the form:

: <math>F(x)|\nabla T(x)|=1.</math>

Line 9 ⟶ 10:

This problem is a special case of [[level set method|level set methods]]. More general algorithms exist but are normally slower

<gallery>

Image:Fast_marching_maze.png| Maze as speed function shortest path

Image:Fast_marching_multi_stencil_2th_order.png|Distance map multi-stencils with random source points

</gallery>

==External links==

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

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