EGPGV15: Eurographics Symposium on Parallel Graphics and Visualization

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/12465

Browse

Browsing EGPGV15: Eurographics Symposium on Parallel Graphics and Visualization by Subject "I.3.3 [Computer Graphics]"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Visualization Showcase: General-Relativistic Black Hole Visualization
    (The Eurographics Association, 2015) Müller, Thomas; Boblest, Sebastian; Weiskopf, Daniel; C. Dachsbacher and P. Navrátil
    Black holes are among the most fascinating and weird objects in the universe. They distort space and time in their close neighborhood in a way that is far beyond our every day experience. We demonstrate the visual effects of this curved spacetime by means of four-dimensional nonlinear ray tracing applied to an accretion disk around a spinning black hole and a sphere oscillating between two static, charged black holes. We discuss how visualization helps predict and communicate the interesting effects of general relativity, in particular, its geometric effects on light propagation. The nonlinear behavior of light propagation leads to a compute-intensive rendering process; we report on our experiences with highly parallel rendering in this context.
  • Thumbnail Image
    Item
    Volume Rendering Via Data-Parallel Primitives
    (The Eurographics Association, 2015) Larsen, Matthew; Labasan, Stephanie; Navrátil, Paul; Meredith, Jeremy; Childs, Hank; C. Dachsbacher and P. Navrátil
    Supercomputing designs have recently evolved to include architectures beyond the standard CPU. In response, visualization software must be developed in a manner that obviates the need for porting all visualization algorithms to all architectures. Recent research results indicate that building visualization software on a foundation of dataparallel primitives can meet this goal, providing portability over many architectures, and doing it in a performant way. With this work, we introduce an unstructured data volume rendering algorithm which is composed entirely of data-parallel primitives. We compare the algorithm to community standards, and show that the performance we achieve is similar. That is, although our algorithm is hardware-agnostic, we demonstrate that our performance on GPUs is comparable to code that was written for and optimized for the GPU, and our performance on CPUs is comparable to code written for and optimized for the CPU. The main contribution of this work is in realizing the benefits of data-parallel primitives - portable performance, longevity, and programmability - for volume rendering. A secondary contribution is in providing further evidence of the merits of the data-parallel primitives approach itself.