Skip to main content
Journal cover image

O(N) implementation of the fast marching algorithm

Publication ,  Journal Article
Yatziv, L; Bartesaghi, A; Sapiro, G
Published in: Journal of Computational Physics
March 1, 2006

In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that in practice reduces the original run-time from O(N log N) 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 priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach. © 2005 Elsevier Inc. All rights reserved.

Duke Scholars

Published In

Journal of Computational Physics

DOI

EISSN

1090-2716

ISSN

0021-9991

Publication Date

March 1, 2006

Volume

212

Issue

2

Start / End Page

393 / 399

Related Subject Headings

  • Applied Mathematics
  • 51 Physical sciences
  • 49 Mathematical sciences
  • 40 Engineering
  • 09 Engineering
  • 02 Physical Sciences
  • 01 Mathematical Sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Yatziv, L., Bartesaghi, A., & Sapiro, G. (2006). O(N) implementation of the fast marching algorithm. Journal of Computational Physics, 212(2), 393–399. https://doi.org/10.1016/j.jcp.2005.08.005
Yatziv, L., A. Bartesaghi, and G. Sapiro. “O(N) implementation of the fast marching algorithm.” Journal of Computational Physics 212, no. 2 (March 1, 2006): 393–99. https://doi.org/10.1016/j.jcp.2005.08.005.
Yatziv L, Bartesaghi A, Sapiro G. O(N) implementation of the fast marching algorithm. Journal of Computational Physics. 2006 Mar 1;212(2):393–9.
Yatziv, L., et al. “O(N) implementation of the fast marching algorithm.” Journal of Computational Physics, vol. 212, no. 2, Mar. 2006, pp. 393–99. Scopus, doi:10.1016/j.jcp.2005.08.005.
Yatziv L, Bartesaghi A, Sapiro G. O(N) implementation of the fast marching algorithm. Journal of Computational Physics. 2006 Mar 1;212(2):393–399.
Journal cover image

Published In

Journal of Computational Physics

DOI

EISSN

1090-2716

ISSN

0021-9991

Publication Date

March 1, 2006

Volume

212

Issue

2

Start / End Page

393 / 399

Related Subject Headings

  • Applied Mathematics
  • 51 Physical sciences
  • 49 Mathematical sciences
  • 40 Engineering
  • 09 Engineering
  • 02 Physical Sciences
  • 01 Mathematical Sciences