2D fast marching algorithm

computation of distance maps using fast marching
3.8K Downloads
Updated Mon, 29 Jul 2013 13:36:21 +0000

View License

Compute the distance map to a set of points using the fast marching algorithm.
Solves the 2-D eikonal PDE with constant speed T=1.
It is not very general but well suited for learning.

Cite As

Juan Cardelino (2024). 2D fast marching algorithm (https://www.mathworks.com/matlabcentral/fileexchange/18529-2d-fast-marching-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2006a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.3.0.0

Just added a screenshot and improved documentation.

1.0.0.0

corrected input arguments and changed naming conventions. corrected some mlint warnings too