Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#264999] of Guillermo Sapiro

Papers Published

  1. Yatziv, L; Bartesaghi, A; Sapiro, G, O(N) implementation of the fast marching algorithm, Journal of Computational Physics, vol. 212 no. 2 (March, 2006), pp. 393-399, Elsevier BV [doi]
    (last updated on 2019/06/20)

    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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320