title: Sort-first parallel volume rendering.
abstract: 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.
authors.affiliation: AIRC—Advanced Imaging Research Center, Oregon Heath Science University, 3181 SW Sam Jackson Park Rd, L452, Portland, OR 97239, USA. moloney@ohsu.edu
authors.forename: Brendan
authors.initials: B
authors.lastname: Moloney
authors.forename: Marco
authors.initials: M
authors.lastname: Ament
authors.forename: Daniel
authors.initials: D
authors.lastname: Weiskopf
authors.forename: Torsten
authors.initials: T
authors.lastname: Möller