Logo der Universität Wien

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.

Grafik Top
Authors
Grafik Top
Supplemental Material
Citation
Category
Journal Paper
Divisions
Visualization and Data Analysis
Journal or Publication Title
IEEE Transactions on Visualization and Computer Graphics
ISSN
-
Page Range
pp. 1164-1177
Number
8
Volume
17
Date
2011
Export
Grafik Top
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna