We present a fast algorithm for solving the eikonal equation in three dimensions, based on the fast marching method. The algorithm is of the order O(N log N), where N is the total number of grid points in the computational domain. The algorithm can be used in any orthogonal coordinate system and globally constructs the solution to the eikonal equation for… (More)