2D fast marching algorithm

computation of distance maps using fast marching

Version 1.3.0.0 (3.44 KB)
3.8K Downloads
(1)
29 Jul 2013

You are now following this Submission

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 (2026). 2D fast marching algorithm (https://www.mathworks.com/matlabcentral/fileexchange/18529-2d-fast-marching-algorithm), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Geometry and Mesh in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
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