Efficient parallel computation of projections for animated volume visualization

Tung Kuang Wu, M. L. Brady

Research output: Contribution to journalConference articlepeer-review


In this paper, we parallelize a new efficient approximate projection algorithm for volume rendering. The algorithm is unique in that it computes N different views simultaneously, much faster than these projections could be computed independently. It is thus ideal for computing animated sequences of views. We implement and evaluate the algorithm on a MasPar MP-1. We render a 128x128x128 data set at up to 21 frames per second average on a 1K PE MasPar MP-1 using gray scale volumetric compositing (simpler transformations are computed even faster).

Original languageEnglish
Article number5727827
Pages (from-to)III39-III42
JournalProceedings of the International Conference on Parallel Processing
Publication statusPublished - 1994
Event23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States
Duration: 1994 Aug 151994 Aug 19

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Efficient parallel computation of projections for animated volume visualization'. Together they form a unique fingerprint.

Cite this