This is the simplest algorithm and one that is frequently used. At each trace location the time at which the curve crosses the trace is calculated. A value for the trace at this time is then added into the integral. The value may be the value at the nearest time sample, or it may be a value interpolated from the neighboring time samples.

Figure 3

This method is illustrated in figure . The sample value at
the trace crossing has been assigned to the region of the curve
between (*x*_{ix} + *x*_{ix-1})/2 and (*x*_{ix+1} + *x*_{ix})/2. Each
trace is sampled at a single location. This approach can lead to
operator aliasing when the dip of the summation trajectory is steep.
The plot on the right of figure shows a weighting function
for each trace, the integration can be implemented by multiplying each
trace by the weighting function and summing. The weighting function
depends on the sampling between the traces. Since this is a space
integral the weight at the sampled point will be the average distance
to the neighboring traces, i.e. the spatial length of the integration
path for which the sample value is used.

11/17/1997