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

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 c...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 25(2019), 7 vom: 02. Juli, Seite 2349-2361
1. Verfasser: Binyahib, Roba (VerfasserIn)
Weitere Verfasser: Peterka, Tom, Larsen, Matthew, Ma, Kwan-Liu, Childs, Hank
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2019
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM286365472
003 DE-627
005 20231225051535.0
007 cr uuu---uuuuu
008 231225s2019 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2018.2833113  |2 doi 
028 5 2 |a pubmed24n0954.xml 
035 |a (DE-627)NLM286365472 
035 |a (NLM)29994004 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Binyahib, Roba  |e verfasserin  |4 aut 
245 1 2 |a A Scalable Hybrid Scheme for Ray-Casting of Unstructured Volume Data 
264 1 |c 2019 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 20.11.2019 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Peterka, Tom  |e verfasserin  |4 aut 
700 1 |a Larsen, Matthew  |e verfasserin  |4 aut 
700 1 |a Ma, Kwan-Liu  |e verfasserin  |4 aut 
700 1 |a Childs, Hank  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 25(2019), 7 vom: 02. Juli, Seite 2349-2361  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:25  |g year:2019  |g number:7  |g day:02  |g month:07  |g pages:2349-2361 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2018.2833113  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 25  |j 2019  |e 7  |b 02  |c 07  |h 2349-2361