Publisher review:Toolbox Fast Marching - A toolbox for the computation of the Fast Marching algorithm in 2D and 3D. The Fast Marching algorithm, introduced by Sethian (1996) is a numerical algorithm that is able to catch the viscosity solution of the Eikonal equation |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 constant, and a weighted riemanian manifold with P varying).The functions 'perform_fast_marching_2d', 'perform_fast_marching_3d' and 'perform_fast_marching_mesh' compute the distance function from a set of starting points. To extract the geodesics between these starting points and an ending point, you can use 'extract_path_2d' and 'extract_path_3d'.The main computation are done in a mex file so it is very fast (using a C heap structure). Precompiled version (.dll) for Windows are given.
Toolbox Fast Marching is a Matlab script for Mathematics scripts design by Gabriel Peyre.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Operating system:Windows / Linux / Mac OS / BSD / Solaris
Toolbox Fast Marching script details 
