A path through a volume can be defined as a parametric curve , where M is the number of dimensions and t is a free parameter.

In practice, though, what a user specifies is not a continuous but rather a finite, discrete set of vectors corresponding to points along , say . In each dimension , a set can be formed, where refers to the jth coordinate of vector *x*_{i}. So, from a set of N vectors, M sets each containing N parameter-coordinate pairs are obtained. Each *X*_{j} is correctly viewed as a discrete set of samples from the *x*_{j}(*t*), a scalar continuous function.

Recovering each *x*_{j}(*t*) from its samples *X*_{j} is a standard problem in interpolation. Assuming that the user has sampled densely enough so that there are no high-frequency oscillations for between samples, a good interpolating function for each *x*_{j}(*t*) can be constructed using a cubic spline Hou and Andrews (1978). A cubic spline is a curve that passes through the sample points and has continuous first and second derivatives. Thereafter, the interpolated curve can be sampled as densely as needed to give a good visual representation of the path.

A very sparse set of starting samples is shown on the left of Fig. 6, marked with *x* symbols. Using cubic spline interpolation and then sampling at a higher rate, the curve shown on the right of Fig. 6 is obtained. The user only has to specify a minimal set of points, as few as two, to generate a path. In fact, Path View includes an algorithm, described in Section 3.3, to allow the user to input unordered points, such as first specifying two endpoints and then specifying a middle point.

Figure 6

1/16/2007