Hybrid Data Visualization Based on Depth Complexity Histogram Analysis
| dc.contributor.author | Lindholm, S. | en_US |
| dc.contributor.author | Falk, M. | en_US |
| dc.contributor.author | Sundén, E. | en_US |
| dc.contributor.author | Bock, A. | en_US |
| dc.contributor.author | Ynnerman, A. | en_US |
| dc.contributor.author | Ropinski, T. | en_US |
| dc.contributor.editor | Deussen, Oliver and Zhang, Hao (Richard) | en_US |
| dc.date.accessioned | 2015-03-02T19:44:47Z | |
| dc.date.available | 2015-03-02T19:44:47Z | |
| dc.date.issued | 2015 | en_US |
| dc.description.abstract | In many cases, only the combination of geometric and volumetric data sets is able to describe a single phenomenon under observation when visualizing large and complex data. When semi‐transparent geometry is present, correct rendering results require sorting of transparent structures. Additional complexity is introduced as the contributions from volumetric data have to be partitioned according to the geometric objects in the scene. The A‐buffer, an enhanced framebuffer with additional per‐pixel information, has previously been introduced to deal with the complexity caused by transparent objects. In this paper, we present an optimized rendering algorithm for hybrid volume‐geometry data based on the A‐buffer concept. We propose two novel components for modern GPUs that tailor memory utilization to the depth complexity of individual pixels. The proposed components are compatible with modern A‐buffer implementations and yield performance gains of up to eight times compared to existing approaches through reduced allocation and reuse of fast cache memory. We demonstrate the applicability of our approach and its performance with several examples from molecular biology, space weather and medical visualization containing both, volumetric data and geometric structures.We present an A‐buffer based algorithm that achieves performance gains of up to eight times relative existing techniques. The algorithm contains two novel components which improve the utilization of the local cache memory on the GPU. This is particularly important for scenes with non‐uniform depth complexities and rapidly decreasing depth complexity histograms (DCHs). | en_US |
| dc.description.number | 1 | en_US |
| dc.description.sectionheaders | Articles | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 34 | en_US |
| dc.identifier.doi | 10.1111/cgf.12460 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12460 | en_US |
| dc.publisher | Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.title | Hybrid Data Visualization Based on Depth Complexity Histogram Analysis | en_US |