O(N) implementation of the fast marching algorithm


Journal Article

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.

Full Text

Duke Authors

Cited Authors

  • Yatziv, L; Bartesaghi, A; Sapiro, G

Published Date

  • March 1, 2006

Published In

Volume / Issue

  • 212 / 2

Start / End Page

  • 393 - 399

Electronic International Standard Serial Number (EISSN)

  • 1090-2716

International Standard Serial Number (ISSN)

  • 0021-9991

Digital Object Identifier (DOI)

  • 10.1016/j.jcp.2005.08.005

Citation Source

  • Scopus