Abstract
A data-parallel processing approach is promising for real-time volume rendering because of the massive parallelism in volume rendering. In data-parallel volume rendering, local results processing elements(PEs) generate from allocated subvolumes are integrated to form a final image. Generally, the integration causes an overhead unavoidable in data-parallel volume rendering due to communications among PEs. This paper proposes a data-parallel shear-warp volume rendering algorithm combined with an adaptive volume subdivision method to reduce the communication overhead and improve processing efficiency. We implement the parallel algorithm on a message-passing multiprocessor system for performance evaluation. The experimental results show that the adaptive volume subdivision method can reduce the overhead and achieve higher efficiency compared with a conventional slab subdivision method.
| Original language | English |
|---|---|
| Pages (from-to) | 80-89 |
| Number of pages | 10 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E83-D |
| Issue number | 1 |
| Publication status | Published - 2000 |
Keywords
- Adaptive volume subdivision
- Data-parallel volume rendering
- Image composition
- Message-passing multiprocessors
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence