3-D network ray tracing

Ludek Klimes & Michal Kvasnicka

Summary

An efficient algorithm of the network shortest path calculation of rays and travel times of the first arrivals is described. The travel-time error of such computations is estimated. The rough estimate of the relative travel-time error is evaluated locally at all network nodes prior to network ray tracing, and is minimized by means of a proper choice of the sizes of forward stars. In this way, the structure of the network is adjusted for a particular model and for a particular computer memory. After network ray tracing, the error estimate is refined and the absolute error bounds of the calculated travel times are evaluated. The method and its accuracy is demonstrated on numerical examples.

Keywords

Graph, network, shortest path, travel time, two-point ray tracing.

Whole paper

The scanned reprint of the paper is available in PDF 300dpi (1215 kB).


Geophys. J. int., 116 (1994), 726-738.
SW3D - main page of consortium Seismic Waves in Complex 3-D Structures .