SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering

  • Authors:

  • Aleksander Stompel;Kwan-Liu Ma;Eric B. Lum;James Ahrens;John Patchett

  • Affiliations:

  • University of California at Davis;University of California at Davis;University of California at Davis;Los Alamos National Laboratory;Los Alamos National Laboratory

  • Venue:
  • PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers connected by a network. In sort-last parallel volume rendering, each processor generates an image of its assigned subvolume, which is blended together with other images to derive the final image. Improving the efficiency of this compositing step, which requires interprocesssor communication, is the key to scalable, interactive rendering. The recent trend of using hardware-accelerated volume rendering demands further acceleration of the image compositing step. This paper presents a new optimized parallel image compositing algorithm and its performance on a PC cluster. Our test results show that this new algorithm offers significant savings over previous algorithms in both communication and compositing costs. On a 64-node PC cluster with a 100BaseT network interconnect, we can achieve interactive rendering rates for images at resolutions up to 1024 脳 1024 pixels at several frames per second.