PARM: data structure for efficient volume ray casting

  • Authors:
  • Sukhyun Lim;Byeong-Seok Shin

  • Affiliations:
  • Dept. Computer Science and Information Engineering, Inha University, Inchon, Rep. of Korea;Dept. Computer Science and Information Engineering, Inha University, Inchon, Rep. of Korea

  • Venue:
  • ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.