Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
Parallel volume visualization on a hypercube architecture
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Volume rendering on scalable shared-memory MIMD architectures
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Segmented ray casting for data parallel volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Parallel volume rendering and data coherence
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A task adaptive parallel graphics renderer
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Scalable parallel volume raycasting for nonrectilinear computational grids
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Multi-frame thrashless ray casting with advancing ray-front
GI '96 Proceedings of the conference on Graphics interface '96
Interactive ray tracing for isosurface rendering
Proceedings of the conference on Visualization '98
Summed-area tables for texture mapping
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Real-time Volume Graphics
Efficient Space-Leaping Using Optimal Block Sets
IEICE - Transactions on Information and Systems
A distance template for octree traversal in CPU-based volume ray casting
The Visual Computer: International Journal of Computer Graphics
A Half-Skewed Octree for Volume Ray Casting
IEICE - Transactions on Information and Systems
Hi-index | 0.00 |
For an efficient parallel volume ray casting suitable for recent multi-core CPUs, we propose an image-ordered approach by using a cost function to allocate loaded tasks impartially per each processing node. At the first frame, we divide an image space evenly, and we compute a cost function. By applying the frame coherence property, we divide the image space unevenly using the computed previous cost function since the next frame. Conventional image-ordered parallel approaches have focused on dividing and compositing volume datasets. However, the divisions and accumulations are negligible for recent multi-core CPUs because they are performed inside one physical CPU. As a result, we can reduce the rendering time without deteriorating the image quality by applying a cost function reflecting on all time-consuming steps of the volume ray casting.