Computing first-arrival seismic traveltimes on unstructured 3-D tetrahedral grids using the Fast Marching Method

SUMMARY The Fast Marching Method is an efficient numerical algorithm for propagating interfaces such as first-arrival seismic wave fronts travelling through a velocity distribution. Fast Marching solutions have been developed for use on rectilinear grids in 2-D and 3-D. We are interested in unstructured grids as they provide some computational advantages when dealing with complicated shapes that are difficult to represent with rectilinear grids. Fast Marching solutions have also been developed for unstructured 2-D triangular grids but this has yet to be extended to unstructured 3-D tetrahedral grids. In this paper, we extend the Fast Marching Method to unstructured 3-D tetrahedral grids using a derivation that follows the 2-D case. The resulting equations are discussed in intuitive terms and an error analysis is performed. Our method is applied to a simple synthetic example and to a more complicated model based on the Voisey's Bay massive sulphide deposit in Labrador, Canada.

[1]  J. Sethian,et al.  Ordered upwind methods for static Hamilton–Jacobi equations , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  J. Vidale.  Finite-difference calculation of travel times , 1988 .

[3]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[4]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[5]  Houman Borouchaki,et al.  Editorial: Mesh generation - Applications and adaptation , 2010 .

[6]  J. Vidale.  Finite‐difference calculation of traveltimes in three dimensions , 1990 .

[7]  H. Si.  Three Dimensional Boundary Conforming Delaunay Mesh Generation , 2008 .

[8]  H. Si.  Constrained Delaunay tetrahedral mesh generation and refinement , 2010 .

[9]  Alex M. Andrew,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition) , 2000 .

[10]  Richard I. Cook,et al.  3-D traveltime computation using second‐order ENO scheme , 1999 .

[11]  Malcolm Sambridge,et al.  A practical grid-based method for tracking multiple refraction and reflection phases in three-dimensional heterogeneous media , 2006 .

[12]  M. Sambridge,et al.  Wave front evolution in strongly heterogeneous layered media using the fast marching method , 2004 .

[13]  M. Sambridge,et al.  Adaptive whole Earth tomography , 2003 .

[14]  C. Hurich,et al.  Physical property analysis, numerical and scale modeling for planning of seismic surveys: Voisey's Bay, Labrador , 2006 .

[15]  Malcolm Sambridge,et al.  Seismic tomography with irregular meshes , 2013 .

[16]  D. Hale,et al.  Meshing for velocity modeling and ray tracing in complex velocity fields , 2006 .

[17]  K. Gärtner,et al.  Boundary conforming Delaunay mesh generation , 2010 .

[18]  A. Balch,et al.  A dynamic programming approach to first arrival traveltime computation in media with arbitrarily distributed velocities , 1992 .

[19]  J. A. Sethian,et al.  Fast Marching Methods , 1999, SIAM Rev..

[20]  Tariq Alkhalifah,et al.  Implementing the fast marching eikonal solver: spherical versus Cartesian coordinates , 2001 .

[21]  Sergey Fomel,et al.  A variational formulation of the fast marching eikonal solver , 2000 .

[22]  John A. Hole,et al.  3-D finite-difference reflection travel times , 1995 .

[23]  P. Podvin,et al.  Finite difference computation of traveltimes in very contrasted velocity models: a massively parallel approach and its associated tools , 1991 .

[24]  Gerard T. Schuster,et al.  Finite‐difference solution of the eikonal equation along expanding wavefronts , 1992 .

[25]  J. Sethian,et al.  Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[26]  J. Sethian,et al.  3-D traveltime computation using the fast marching method , 1999 .

[27]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[28]  H. Si,et al.  Adaptive tetrahedral mesh generation by constrained Delaunay refinement , 2008 .

[29]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Jean Brac,et al.  Can we image complex structures with first‐arrival traveltime? , 1993 .

[31]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[32]  M. Sambridge,et al.  Multiple reflection and transmission phases in complex layered media using a multistage fast marching method , 2004 .

[33]  J. Sethian,et al.  Fast-phase space computation of multiple arrivals , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[34]  M. Sambridge,et al.  Tomographic systems of equations with irregular cells , 1998 .