Improvement and realization of linear travel-time interpolation ray tracing algorithm

Аннотация

The linear travel-time interpolation ray tracing algorithm has a drawback: rays can't go round the low velocity area if the launching point, the receiving point and the low velocity area distribute on the same column (row). Aiming at the drawback, an improved algorithm is proposed on the basis of researching reconstruction theories. The given algorithm adopts a cross-scanning strategy to carry out forward processing and uses discrete points as the secondary sources to simplify backward processing. The numerical simulation experiments show that the rays can go round the low velocity areas located in the same column (row) of the launching points and the receiving points. Rays scan over the global region only once.