IEICE TRANSACTIONS on Information
Efficient Space-Leaping Using Optimal Block Sets
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.12 pp.2864-2870
- Publication Date
- 2005/12/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.12.2864
- Type of Manuscript
- PAPER
- Category
- Computer Graphics
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sukhyun LIM, Byeong-Seok SHIN, "Efficient Space-Leaping Using Optimal Block Sets" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 12, pp. 2864-2870, December 2005, doi: 10.1093/ietisy/e88-d.12.2864.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.12.2864/_p
Copy
@ARTICLE{e88-d_12_2864,
author={Sukhyun LIM, Byeong-Seok SHIN, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Space-Leaping Using Optimal Block Sets},
year={2005},
volume={E88-D},
number={12},
pages={2864-2870},
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.},
keywords={},
doi={10.1093/ietisy/e88-d.12.2864},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Efficient Space-Leaping Using Optimal Block Sets
T2 - IEICE TRANSACTIONS on Information
SP - 2864
EP - 2870
AU - Sukhyun LIM
AU - Byeong-Seok SHIN
PY - 2005
DO - 10.1093/ietisy/e88-d.12.2864
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2005
AB - 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.
ER -
English
