A fast pipelined parallel ray casting algorithm using advanced space leaping method

Hyung Jun Kim, Yong Je Woo, Yong Won Kwon, So Hyun Ryu, Chang-Sung Jeong

Research output: Contribution to journalArticle

Abstract

In this paper we present a very fast pipelined parallel ray casting algorithm for volume rendering. Our algorithm is based on an extended space leaping method which minimizes the traversal of data and image space by using run-length encoding and line drawing algorithms. We propose a more advanced space leaping method which allows the efficient implementation of parallel forward projection by merging the run-lengths for the line drawing. We shall show that the whole algorithm is sharply speed up by reducing the time taken to project the run-lengths onto the image screen, and by exploiting the pipelined parallelism in our space leaping method. Also, we shall show the experimental result of the parallel ray casting algorithm implemented on our Computational Grid portal environment.

Original languageEnglish
Pages (from-to)244-252
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2763
Publication statusPublished - 2003 Dec 1

Fingerprint

Casting
Half line
Line Drawing
Run Length
Grid Portal
Run-length Encoding
Volume Rendering
Volume rendering
Image Space
Computational Grid
Efficient Implementation
Merging
Parallelism
Speedup
Projection
Minimise
Experimental Results

Keywords

  • Grid
  • Grid Portal
  • Parallel ray casting
  • Space leaping
  • Volume rendering

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{cdbccd9304734fa3a20c265fed5790b6,
title = "A fast pipelined parallel ray casting algorithm using advanced space leaping method",
abstract = "In this paper we present a very fast pipelined parallel ray casting algorithm for volume rendering. Our algorithm is based on an extended space leaping method which minimizes the traversal of data and image space by using run-length encoding and line drawing algorithms. We propose a more advanced space leaping method which allows the efficient implementation of parallel forward projection by merging the run-lengths for the line drawing. We shall show that the whole algorithm is sharply speed up by reducing the time taken to project the run-lengths onto the image screen, and by exploiting the pipelined parallelism in our space leaping method. Also, we shall show the experimental result of the parallel ray casting algorithm implemented on our Computational Grid portal environment.",
keywords = "Grid, Grid Portal, Parallel ray casting, Space leaping, Volume rendering",
author = "Kim, {Hyung Jun} and Woo, {Yong Je} and Kwon, {Yong Won} and Ryu, {So Hyun} and Chang-Sung Jeong",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2763",
pages = "244--252",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A fast pipelined parallel ray casting algorithm using advanced space leaping method

AU - Kim, Hyung Jun

AU - Woo, Yong Je

AU - Kwon, Yong Won

AU - Ryu, So Hyun

AU - Jeong, Chang-Sung

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In this paper we present a very fast pipelined parallel ray casting algorithm for volume rendering. Our algorithm is based on an extended space leaping method which minimizes the traversal of data and image space by using run-length encoding and line drawing algorithms. We propose a more advanced space leaping method which allows the efficient implementation of parallel forward projection by merging the run-lengths for the line drawing. We shall show that the whole algorithm is sharply speed up by reducing the time taken to project the run-lengths onto the image screen, and by exploiting the pipelined parallelism in our space leaping method. Also, we shall show the experimental result of the parallel ray casting algorithm implemented on our Computational Grid portal environment.

AB - In this paper we present a very fast pipelined parallel ray casting algorithm for volume rendering. Our algorithm is based on an extended space leaping method which minimizes the traversal of data and image space by using run-length encoding and line drawing algorithms. We propose a more advanced space leaping method which allows the efficient implementation of parallel forward projection by merging the run-lengths for the line drawing. We shall show that the whole algorithm is sharply speed up by reducing the time taken to project the run-lengths onto the image screen, and by exploiting the pipelined parallelism in our space leaping method. Also, we shall show the experimental result of the parallel ray casting algorithm implemented on our Computational Grid portal environment.

KW - Grid

KW - Grid Portal

KW - Parallel ray casting

KW - Space leaping

KW - Volume rendering

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

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

M3 - Article

AN - SCOPUS:35248838947

VL - 2763

SP - 244

EP - 252

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -