2D fast marching algorithm
by Juan Cardelino
30 Jan 2008
(Updated 29 Jul 2013)
computation of distance maps using fast marching
|
Watch this File
|
| File Information |
| Description |
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. |
| MATLAB release |
MATLAB 7.2 (R2006a)
|
| Other requirements |
Tested in Matlab 2012a |
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (8) |
| 14 Mar 2012 |
Shinen Lo
|
|
|
| 17 Oct 2011 |
Juan Cardelino
|
|
|
| 16 Jun 2011 |
ladi
|
|
|
| 05 Feb 2008 |
Juan Cardelino
|
|
|
| 05 Feb 2008 |
igor scardanzan
|
|
|
| 04 Feb 2008 |
w s
|
|
|
| 01 Feb 2008 |
Juan Cardelino
|
|
|
| 30 Jan 2008 |
w s
|
|
|
| Updates |
| 01 Feb 2008 |
improved the help and input arguments |
| 01 Feb 2008 |
improved documentation |
| 13 Aug 2008 |
corrected input arguments and changed naming conventions. corrected some mlint warnings too |
| 29 Jul 2013 |
Just added a screenshot and improved documentation. |
|
Contact us