Summary of the algorithm

Our algorithm for trace interpolation can be summarized as follows:

$$\begin{array} {l} {\tt \ for \ each \ subwindow} \\ \ \lef... ... \ {\tt \ merge \ subwindows} \end{array} \right.\end{array}$$

Because of the additional computation involved, this algorithm is about twice as slow as Spitz's algorithm.