Parallel Cell Projection Rendering of Adaptive Mesh Refinement Data
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
IEICE - Transactions on Information and Systems
Multi-GPU volume rendering using MapReduce
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Proceedings of the Digital Production Symposium
Scalable sort-first parallel direct volume rendering with dynamic load balancing
EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization
A virtual reality toolkit for the diagnosis and monitoring of myocardial infarctions
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
On visualization and reconstruction from non-uniform point sets using B-splines
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
In this paper, we present an algorithm that accelerates 3D texture-based volume rendering of large, sparse data sets, i.e., data sets where only a traction of the voxels contain relevant information. In texture-based approaches, the rendering performance is affected by the fill-rate, the size of texture memory, and the texture I/O bandwidth. For sparse data, these limitations can be circumvented by restricting most of the rendering work to the relevant parts of the volume. In order to efficiently enclose the corresponding regions with axis-aligned boxes, we employ a hierarchical data structure, known as an AMR (adaptive mesh refinement) tree. The hierarchy is generated utilizing a clustering algorithm. A good balance is thereby achieved between the size of the enclosed volume, i.e., the amount to render in graphics hardware and the number of axis-aligned regions, i.e., the number of texture coordinates to compute in software. The waste of texture memory by the power-of-two restriction is minimized by a 3D packing algorithm which arranges texture bricks economically in memory. Compared to an octree approach, the rendering performance is significantly increased and less parameter tuning is necessary.