A Scalable Hybrid Scheme for Ray-Casting of Unstructured Volume Data

Roba Binyahib, Tom Peterka, Matthew Larsen, Kwan-Liu Ma, Hank Childs

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We present an algorithm for parallel volume rendering that is a hybrid between classical object order and image order techniques. The algorithm operates on unstructured grids (and structured ones), and thus can deal with block boundaries interleaving in complex ways. It also deals effectively with cases that are prone to load imbalance, i.e., cases where cell sizes differ dramatically, either because of the nature of the input data, or because of the effects of the camera transformation. The algorithm divides work over resources such that each phase of its processing is bounded in the amount of computation it can perform. We demonstrate its efficacy through a series of studies, varying over camera position, data set size, transfer function, image size, and processor count. At its biggest, our experiments scaled up to 8,192 processors and operated on data sets with more than one billion cells. In total, we find that our hybrid algorithm performs well in all cases. This is because our algorithm naturally adapts its computation based on workload, and can operate like either an object order technique or an image order technique in scenarios where those techniques are efficient.

Original languageEnglish (US)
JournalIEEE Transactions on Visualization and Computer Graphics
DOIs
StateAccepted/In press - May 4 2018

Fingerprint

Casting
Cameras
Volume rendering
Transfer functions
Processing
Experiments

Keywords

  • Cameras
  • Computer architecture
  • Data visualization
  • Equalizers
  • large scale visualization
  • Load management
  • Microprocessors
  • parallel visualization
  • Rendering (computer graphics)
  • Volume rendering

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

A Scalable Hybrid Scheme for Ray-Casting of Unstructured Volume Data. / Binyahib, Roba; Peterka, Tom; Larsen, Matthew; Ma, Kwan-Liu; Childs, Hank.

In: IEEE Transactions on Visualization and Computer Graphics, 04.05.2018.

Research output: Contribution to journalArticle

@article{e6fbcac6a47746b99f0658c1bd3f64b5,
title = "A Scalable Hybrid Scheme for Ray-Casting of Unstructured Volume Data",
abstract = "We present an algorithm for parallel volume rendering that is a hybrid between classical object order and image order techniques. The algorithm operates on unstructured grids (and structured ones), and thus can deal with block boundaries interleaving in complex ways. It also deals effectively with cases that are prone to load imbalance, i.e., cases where cell sizes differ dramatically, either because of the nature of the input data, or because of the effects of the camera transformation. The algorithm divides work over resources such that each phase of its processing is bounded in the amount of computation it can perform. We demonstrate its efficacy through a series of studies, varying over camera position, data set size, transfer function, image size, and processor count. At its biggest, our experiments scaled up to 8,192 processors and operated on data sets with more than one billion cells. In total, we find that our hybrid algorithm performs well in all cases. This is because our algorithm naturally adapts its computation based on workload, and can operate like either an object order technique or an image order technique in scenarios where those techniques are efficient.",
keywords = "Cameras, Computer architecture, Data visualization, Equalizers, large scale visualization, Load management, Microprocessors, parallel visualization, Rendering (computer graphics), Volume rendering",
author = "Roba Binyahib and Tom Peterka and Matthew Larsen and Kwan-Liu Ma and Hank Childs",
year = "2018",
month = "5",
day = "4",
doi = "10.1109/TVCG.2018.2833113",
language = "English (US)",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - A Scalable Hybrid Scheme for Ray-Casting of Unstructured Volume Data

AU - Binyahib, Roba

AU - Peterka, Tom

AU - Larsen, Matthew

AU - Ma, Kwan-Liu

AU - Childs, Hank

PY - 2018/5/4

Y1 - 2018/5/4

N2 - We present an algorithm for parallel volume rendering that is a hybrid between classical object order and image order techniques. The algorithm operates on unstructured grids (and structured ones), and thus can deal with block boundaries interleaving in complex ways. It also deals effectively with cases that are prone to load imbalance, i.e., cases where cell sizes differ dramatically, either because of the nature of the input data, or because of the effects of the camera transformation. The algorithm divides work over resources such that each phase of its processing is bounded in the amount of computation it can perform. We demonstrate its efficacy through a series of studies, varying over camera position, data set size, transfer function, image size, and processor count. At its biggest, our experiments scaled up to 8,192 processors and operated on data sets with more than one billion cells. In total, we find that our hybrid algorithm performs well in all cases. This is because our algorithm naturally adapts its computation based on workload, and can operate like either an object order technique or an image order technique in scenarios where those techniques are efficient.

AB - We present an algorithm for parallel volume rendering that is a hybrid between classical object order and image order techniques. The algorithm operates on unstructured grids (and structured ones), and thus can deal with block boundaries interleaving in complex ways. It also deals effectively with cases that are prone to load imbalance, i.e., cases where cell sizes differ dramatically, either because of the nature of the input data, or because of the effects of the camera transformation. The algorithm divides work over resources such that each phase of its processing is bounded in the amount of computation it can perform. We demonstrate its efficacy through a series of studies, varying over camera position, data set size, transfer function, image size, and processor count. At its biggest, our experiments scaled up to 8,192 processors and operated on data sets with more than one billion cells. In total, we find that our hybrid algorithm performs well in all cases. This is because our algorithm naturally adapts its computation based on workload, and can operate like either an object order technique or an image order technique in scenarios where those techniques are efficient.

KW - Cameras

KW - Computer architecture

KW - Data visualization

KW - Equalizers

KW - large scale visualization

KW - Load management

KW - Microprocessors

KW - parallel visualization

KW - Rendering (computer graphics)

KW - Volume rendering

UR - http://www.scopus.com/inward/record.url?scp=85046496130&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046496130&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2018.2833113

DO - 10.1109/TVCG.2018.2833113

M3 - Article

C2 - 29994004

AN - SCOPUS:85046496130

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

ER -