2D fast marching algorithm
Version 1.3.0.0 (3.44 KB) by
Juan Cardelino
computation of distance maps using fast marching
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 LinuxCategories
- Mathematics and Optimization > Partial Differential Equation Toolbox > Geometry and Mesh >
- Mathematics and Optimization > Partial Differential Equation Toolbox > General PDEs > Visualization >
Find more on Geometry and Mesh in Help Center and MATLAB Answers
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.