O(N) implementation of the fast marching algorithm


In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original run-time from O(N logN) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy… (More)
DOI: 10.1016/j.jcp.2005.08.005


4 Figures and Tables


Citations per Year

255 Citations

Semantic Scholar estimates that this publication has 255 citations based on the available data.

See our FAQ for additional information.