Parallel approximate computation of projections for animated volume rendered displays

We present an approximate volume rendering algorithm that can compute multiple views of a 3D voxel-based data set concurrently. The approach employs a unique new method for combining partial results from neighboring objections to compute a sequence of rotated views, in fewer instructions than would be required for independent computations. For instance, the algorithm can compute a set of N projections through an N/spl times/N/spl times/N data set in only O(log N) parallel steps, using only O(N/sup 3/) total operations (work), matching the bounds for computing a single projection by conventional methods.