Short note: O(N) implementation of the fast marching algorithm

  • Authors:

  • Liron Yatziv;Alberto Bartesaghi;Guillermo Sapiro

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Minnesota Minneapolis, 200 Union Street, SE, Minneapolis, MN 55455, USA;Department of Electrical and Computer Engineering, University of Minnesota Minneapolis, 200 Union Street, SE, Minneapolis, MN 55455, USA;Department of Electrical and Computer Engineering, University of Minnesota Minneapolis, 200 Union Street, SE, Minneapolis, MN 55455, USA

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 2006

Quantified Score

Hi-index 31.46

Visualization

Abstract

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(NlogN) 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.