Data-parallel volume rendering with adaptive volume subdivision

Kentaro Sanq, Hiroyuki Kitajima, Hiroaki Kobayashu, Tadao Nakamura

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)80-89
Number of pages10
JournalIEICE Transactions on Information and Systems
Issue number1
Publication statusPublished - 2000


  • Adaptive volume subdivision
  • Data-parallel volume rendering
  • Image composition
  • Message-passing multiprocessors


Dive into the research topics of 'Data-parallel volume rendering with adaptive volume subdivision'. Together they form a unique fingerprint.

Cite this