Sort-First Parallel Volume Rendering

Brendan Moloney, Marco Ament, Daniel Weiskopf, Torsten Moller
AIRC-Advanced Imaging Research Center, Oregon Heath Science University, Portland, OR, USA
IEEE Transactions on Visualization and Computer Graphics, 2010


   title={Sort-First Parallel Volume Rendering},

   author={Moloney, B. and Ament, M. and Weiskopf, D. and M{\"o}ller, T.},

   journal={IEEE Transactions on Visualization and Computer Graphics},



   publisher={Published by the IEEE Computer Society}


Download Download (PDF)   View View   Source Source   



Sort-first distributions have been studied and used far less than sort-last distributions for parallel volume rendering, especially when the data are too large to be replicated fully. We demonstrate that sort-first distributions are not only a viable method of performing data-scalable parallel volume rendering, but more importantly they allow for a range of rendering algorithms and techniques that are not efficient with sort-last distributions. Several of these algorithms are discussed and two of them are implemented in a parallel environment: a new improved variant of early ray termination to speed up rendering when volumetric occlusion occurs and a volumetric shadowing technique that produces more realistic and informative images based on half angle slicing. Improved methods of distributing the computation of the load balancing and loading portions of a subdivided data set are also presented. Our detailed test results for a typical GPU cluster with distributed memory show that our sort-first rendering algorithm outperforms sort-last rendering in many scenarios.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2020 hgpu.org

All rights belong to the respective authors

Contact us: