3-D traveltime computation using the fast marching method


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)


12 Figures and Tables


Citations per Year

112 Citations

Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics