Abstract
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 language | English |
|---|---|
| Article number | 5727827 |
| Journal | Proceedings of the International Conference on Parallel Processing |
| Volume | 3 |
| DOIs | |
| Publication status | Published - 1994 Jan 1 |
| Event | 23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States Duration: 1994 Aug 15 → 1994 Aug 19 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Mathematics(all)
- Hardware and Architecture
Cite this
}
Efficient parallel computation of projections for animated volume visualization. / Wu, Tung-Kuang; Brady, M. L.
In: Proceedings of the International Conference on Parallel Processing, Vol. 3, 5727827, 01.01.1994.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - Efficient parallel computation of projections for animated volume visualization
AU - Wu, Tung-Kuang
AU - Brady, M. L.
PY - 1994/1/1
Y1 - 1994/1/1
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=84904356621&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904356621&partnerID=8YFLogxK
U2 - 10.1109/ICPP.1994.102
DO - 10.1109/ICPP.1994.102
M3 - Conference article
AN - SCOPUS:84904356621
VL - 3
JO - Proceedings of the International Conference on Parallel Processing
JF - Proceedings of the International Conference on Parallel Processing
SN - 0190-3918
M1 - 5727827
ER -