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 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.