Visibility culling using hierarchical occlusion maps
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
PRS '97 Proceedings of the IEEE symposium on Parallel rendering
Optimizing noncontiguous accesses in MPI – IO
Parallel Computing
Global static indexing for real-time exploration of very large regular grids
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
MPI-IO/GPFS, an optimized implementation of MPI-IO on top of GPFS
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Optical Models for Direct Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Algorithmic Influences on I/O Access Patterns and Parallel File System Performance
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Profile-guided I/O partitioning
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
A Metric for Distributions with Applications to Image Databases
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Visibility Culling Using Plenoptic Opacity Functions for Large Volume Visualization
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Progressive view-dependent isosurface propagation
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
In-situ sampling of a large-scale particle simulation for interactive visualization and analysis
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
We present an I/O optimization method for parallel volume rendering based on visibility and spatial locality. The combined metric is used to organize the file layout of the dataset on a parallel file system. This reduces the number of small, noncontiguous I/O operations and improves load balance among I/O servers. The net result is reduced I/O time. Since large-scale visualization is data-intensive, overall visualization performance improves using this method. This paper explains the preprocessing of data blocks to compute feature vectors and the storage organization based on them. Run-time performance is analyzed with a variety of transfer functions, view directions, system scales, and datasets. Our results show significant performance gains over file layouts based on space-filling curves.