Code covered by the BSD License    Highlights from Toolbox Fast
Marching  image thumbnail  Toolbox Fast Marching    24 Oct 2004
(Updated )   Toolbox Fast Marching - A toolbox for Fast Marching
and level sets computations   Copyright (c) 2008 Gabriel Peyre
The toolbox can be downloaded from Matlab Central  Introduction
to Fast Marching and Level Sets  The Fast Marching algorithm,
introduced by J. Sethian (1996) is a numerical algorithm that is
able to catch the viscosity solution of the Eikonal equation
norm(grad(D))=P. The level set {x \ F(x)=t} can be seen as a
front advancing with speed P(x).  The resulting function D is a
distance function, and if the speed P is constant, it can be
seen as the distance function to a set of starting points.  The
Fast Marching is very similar to the Dijkstra algorithm that
finds shortest paths on graphs. Using a gradient descent of the
distance function D, one is able to extract a good approximation
of the shortest path (geodesic) in various settings (Euclidean
for P const