Parallel stream surface computation for large data sets

Parallel stream surface calculation, while highly related to other particle advection-based techniques such as streamlines, has its own unique characteristics that merit independent study. Specifically, stream surfaces require new integral curves to be added continuously during execution to ensure s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE Symposium on Large Data Analysis and Visualization s. 39 - 47
Hlavní autoři: Camp, David, Childs, Hank, Garth, Christoph, Pugmire, David, Joy, Kenneth I.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2012
Témata:
Approximation algorithms
Approximation methods
Computer Graphics [I.3.3]: Picture/Image Generation - Display algorithms
D.1.3 [Programming Techniques]: Concurrent Programming - Parallel programming
Data visualization
Piecewise linear approximation
Streaming media
Surface treatment
Vectors
ISBN:1467347329, 9781467347327
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Parallel stream surface calculation, while highly related to other particle advection-based techniques such as streamlines, has its own unique characteristics that merit independent study. Specifically, stream surfaces require new integral curves to be added continuously during execution to ensure surface quality and accuracy; performance can be improved by specifically accounting for these additional particles. We present an algorithm for generating stream surfaces in a distributed-memory parallel setting. The algorithm incorporates multiple schemes for parallelizing particle advection and we study which schemes work best. Further, we explore speculative calculation and how it can improve overall performance. In total, this study informs the efficient calculation of stream surfaces in parallel for large data sets, based on existing integral curve functionality.
ISBN:1467347329
9781467347327
DOI:10.1109/LDAV.2012.6378974