This TVCG paper is an extended version of a Vis 2003 paper, with significantly more detail about the time-dependent, sparse-grid GPU computation strategy used in the level-set solver. The paper describes a 3D-to-2D virtual memory address scheme for packing the narrow-band data into GPU memory. It also adds detail about the GPU-based distance transform computation and the GPU-to-CPU message passing approach. Lastly, the paper describes a volume rendering algorithm for rendering compressed data that provides on-the-fly reconstruction, full trilinear interpolation, and the ability to render from any viewpoint without data duplication. (A Streaming Narrow Band Algorithm: Interactive Computation and Visualization of Level Sets. A. Lefohn, J. Kniss, C. Hansen, and R. Whitaker. Transactions on Visualization and Computer Graphics.)

This GH 2003 paper by Kenneth Moreland and Edward Angel describes how to use programmable GPUs to perform the fast Fourier transform (FFT). Their system that can synthesize an image by conventional means, perform the FFT, filter the image, and finally apply the inverse FFT in well under 1 second for a 512 by 512 image. (The FFT on a GPU. Kenneth Moreland and Edward Angel. Graphics Hardware 2003.)