Sample buffer: A progressive refinement ray-casting algorithm for volume rendering

Hao-Ren Ke, Ruei Chuan Chang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Ray-casting has been shown to be an excellent technique for rendering volume data. This paper describes a new ray-casting algorithm that employs the concept of progressive refinement for volume rendering. Volume data are embedded into a complete octree, and when the volume data are rendered, the octree is traversed according to a user-defined threshold. By reducing this threshold gradually, we can render increasingly refined images. Ray-casting is used to explore the octree, and a data structure called a sample buffer (SB) is introduced to reduce the time required to render a series of images. With this method, a satisfactory balance between image quality and computation time can be achieved.

Original languageEnglish
Pages (from-to)277-283
Number of pages7
JournalComputers and Graphics
Volume17
Issue number3
DOIs
Publication statusPublished - 1993 Jan 1

Fingerprint

Volume rendering
Casting
Image quality
Data structures

ASJC Scopus subject areas

  • Engineering(all)
  • Human-Computer Interaction
  • Computer Graphics and Computer-Aided Design

Cite this

Sample buffer : A progressive refinement ray-casting algorithm for volume rendering. / Ke, Hao-Ren; Chang, Ruei Chuan.

In: Computers and Graphics, Vol. 17, No. 3, 01.01.1993, p. 277-283.

Research output: Contribution to journalArticle

@article{6d3e04b82e1442338d77ed2e597e775f,
title = "Sample buffer: A progressive refinement ray-casting algorithm for volume rendering",
abstract = "Ray-casting has been shown to be an excellent technique for rendering volume data. This paper describes a new ray-casting algorithm that employs the concept of progressive refinement for volume rendering. Volume data are embedded into a complete octree, and when the volume data are rendered, the octree is traversed according to a user-defined threshold. By reducing this threshold gradually, we can render increasingly refined images. Ray-casting is used to explore the octree, and a data structure called a sample buffer (SB) is introduced to reduce the time required to render a series of images. With this method, a satisfactory balance between image quality and computation time can be achieved.",
author = "Hao-Ren Ke and Chang, {Ruei Chuan}",
year = "1993",
month = "1",
day = "1",
doi = "10.1016/0097-8493(93)90076-L",
language = "English",
volume = "17",
pages = "277--283",
journal = "Computers and Graphics",
issn = "0097-8493",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Sample buffer

T2 - A progressive refinement ray-casting algorithm for volume rendering

AU - Ke, Hao-Ren

AU - Chang, Ruei Chuan

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Ray-casting has been shown to be an excellent technique for rendering volume data. This paper describes a new ray-casting algorithm that employs the concept of progressive refinement for volume rendering. Volume data are embedded into a complete octree, and when the volume data are rendered, the octree is traversed according to a user-defined threshold. By reducing this threshold gradually, we can render increasingly refined images. Ray-casting is used to explore the octree, and a data structure called a sample buffer (SB) is introduced to reduce the time required to render a series of images. With this method, a satisfactory balance between image quality and computation time can be achieved.

AB - Ray-casting has been shown to be an excellent technique for rendering volume data. This paper describes a new ray-casting algorithm that employs the concept of progressive refinement for volume rendering. Volume data are embedded into a complete octree, and when the volume data are rendered, the octree is traversed according to a user-defined threshold. By reducing this threshold gradually, we can render increasingly refined images. Ray-casting is used to explore the octree, and a data structure called a sample buffer (SB) is introduced to reduce the time required to render a series of images. With this method, a satisfactory balance between image quality and computation time can be achieved.

UR - http://www.scopus.com/inward/record.url?scp=0027590525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027590525&partnerID=8YFLogxK

U2 - 10.1016/0097-8493(93)90076-L

DO - 10.1016/0097-8493(93)90076-L

M3 - Article

AN - SCOPUS:0027590525

VL - 17

SP - 277

EP - 283

JO - Computers and Graphics

JF - Computers and Graphics

SN - 0097-8493

IS - 3

ER -