This paper presents a study of the computational efficiency, that is
accuracy versus computational effort, for solving the Eikonal equation
on quadrilateral grids. The algorithms that are benchmarked against each
other for computations of distance functions are the following: the fast
marching method, the fast sweeping method, an algebraic Newton method, and
also a `brute force` approach. Some comments are also made on the solution of
the Eikonal equation via reformulation to a hyperbolic PDE. The results of the
benchmark clearly indicate that the fast marching method is the preferred
algorithm due to both accuracy and computational speed in our tested context.