Efficient Space-Leaping Using Optimal Block Sets

  • Authors:
  • Sukhyun Lim;Byeong-Seok Shin

  • Affiliations:
  • The authors are with MediaLab, Dept. Computer Science and Information Engineering, Inha University, Inchon 402--751, Korea. E-mail: cgexpert_lim@yahoo.co.kr, E-mail: bsshin@inha.ac.kr;The authors are with MediaLab, Dept. Computer Science and Information Engineering, Inha University, Inchon 402--751, Korea. E-mail: cgexpert_lim@yahoo.co.kr, E-mail: bsshin@inha.ac.kr

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are several optimization techniques available for improving rendering speed of direct volume rendering. An acceleration method using the hierarchical min-max map requires little preprocessing and data storage while preserving image quality. However, this method introduces computational overhead because of unnecessary comparison and level shift between blocks. In this paper, we propose an efficient space-leaping method using optimal-sized blocks. To determine the size of blocks, our method partitions an image plane into several uniform grids and computes the minimum and the maximum depth values for each grid. We acquire optimal block sets suitable for individual rays from these values. Experimental results show that our method reduces rendering time when compared with the previous min-max octree method.