三角网波行面扩展最小走时射线追踪全局算法

A minimum traveltime ray tracing global algorithm on a triangular net for propagating plane waves

To address the problem of subdividing inflexible rectangular grid models and their poor definition of velocity interfaces, we propose a complex structure triangular net for a minimum traveltime ray tracing global algorithm. Our procedure is: (1) Subdivide a triangle grid based on the Delaunay triangular subdivision criterion and the relationships of the points, lines, and the surfaces in the subdividing area. (2) Define the topology relationships and related concepts of triangular unit ray tracing. (3) The source point and wave arrival points at any time compose the propagating plane wave and the minimum traveltime and secondary source positions are calculated during the plane wave propagation. We adopt the hyperbolic approximation global algorithm for secondary source retrieving. (4) By minimum traveltime ray tracing, collect the path from receiver to source points with the neighborhood point’s traveltime and the direction of the secondary source. Numerical simulation examples are given to test the algorithm. The results show that the triangular net ray tracing method demonstrates model subdivision flexibility, precise velocity discontinuity interfaces, and accurate computations.