Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
Fast volume rendering using a shear-warp factorization of the viewing transformation
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A comparison of normal estimation schemes
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive ray tracing for isosurface rendering
Proceedings of the conference on Visualization '98
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Volume Visualization (Tutorial)
Volume Visualization (Tutorial)
Data Visualization Techniques
A new object-order ray-casting algorithm
Proceedings of the conference on Visualization '02
IEEE Transactions on Visualization and Computer Graphics
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
Efficient Space-Leaping Using Optimal Block Sets
IEICE - Transactions on Information and Systems
A-PARM: Adaptive Division of Sub-cells in the PARM for Efficient Volume Ray Casting
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Hi-index | 0.00 |
We propose a new data structure to accelerate the color computation step of CPU-based volume ray casting. To ensure interactive frame rates on a PC platform, we store interpolated scalar value and gradient vector required for color computation step in volume ray casting. However, it is difficult to store those two values in preprocessing step because sample points can lie in arbitrary position in a cell. Therefore, after determining candidate cells that contribute to the final images, we partition each candidate cell into several sub-cells. Then, we store trilinearly interpolated scalar value and an index of encoded gradient vector for each sub-cell. Because the information that requires time-consuming computations is already stored in our data structure, color values are determined without further computations.