A data distributed, parallel algorithm for ray-traced volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Communication Costs for Parallel Volume-Rendering Algorithms
IEEE Computer Graphics and Applications
Generation of transfer functions with stochastic search techniques
Proceedings of the 7th conference on Visualization '96
Design galleries: a general approach to setting parameters for computer graphics and animation
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
A ghost cell expansion method for reducing communications in solving PDE problems
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Optical Models for Direct Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
A Multi-Layered Image Cache for Scientific Visualization
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
GI '07 Proceedings of Graphics Interface 2007
Semantic Layers for Illustrative Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Massively parallel volume rendering using 2-3 swap image compositing
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
A configurable algorithm for parallel image-compositing applications
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
In Situ Visualization for Large-Scale Combustion Simulations
IEEE Computer Graphics and Applications
Interactive Transfer Function Design Based on Editing Direct Volume Rendered Images
IEEE Transactions on Visualization and Computer Graphics
Direct send compositing for parallel sort-last rendering
EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization
Stroke-based transfer function design
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
An exploratory technique for coherent visualization of time-varying volume data
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
A Maya use case: adaptable scientific workflows with ADIOS for general relativistic astrophysics
Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery
| Hi-index | 0.00 |
Successful in-situ and remote visualization solutions must have minimal storage requirements and account for only a small percentage of supercomputing time. One solution that meets these requirements is to store a compact intermediate representation of the data, instead of a 3D volume itself. Recent work explores the use of attenuation functions as a data representation that summarizes the distribution of attenuation along the rays. This representation goes beyond conventional static images and allows users to dynamically explore their data, for example, to change color and opacity parameters, without accessing the original 3D data. The computation and storage costs of this method may still be prohibitively expensive for large and time-varying data sets, thus limiting its applicability in the real-world scenarios. In this paper, we present an efficient algorithm for computing attenuation functions in parallel. We exploit the fact that the distribution of attenuation can be constructed recursively from a hierarchy of blocks or intervals of the data, which is a highly parallelizeable process. We have developed a library of routines that can be used in a distance visualization scenario or can be called directly from a simulation code to generate explorable images in-situ. Through a number of examples, we demonstrate the application of this work to large-scale scientific simulations in a real-world parallel environment with thousands of processors. We also explore various compression methods for reducing the size of the RAF. Finally, we present a method for computing an alternative RAF representation, which more closely encodes the actual distribution of samples along a ray, using kernel density estimation.