Ray-box culling for tree structures

Jae Ho Nah, Woo Chan Park, Yoon Sig Kang, Tack Don Han

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15× faster ray tracing performance and up to 1.22× faster total rendering performance, including tree construction and ray tracing.

Original languageEnglish
Pages (from-to)1211-1225
Number of pages15
JournalJournal of Information Science and Engineering
Volume29
Issue number6
Publication statusPublished - 2013 Nov 1

Fingerprint

Ray tracing
performance
efficiency

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

Nah, J. H., Park, W. C., Kang, Y. S., & Han, T. D. (2013). Ray-box culling for tree structures. Journal of Information Science and Engineering, 29(6), 1211-1225.
Nah, Jae Ho ; Park, Woo Chan ; Kang, Yoon Sig ; Han, Tack Don. / Ray-box culling for tree structures. In: Journal of Information Science and Engineering. 2013 ; Vol. 29, No. 6. pp. 1211-1225.
@article{1ec686de3add4998a9dcf3cddc44fdcf,
title = "Ray-box culling for tree structures",
abstract = "Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15× faster ray tracing performance and up to 1.22× faster total rendering performance, including tree construction and ray tracing.",
author = "Nah, {Jae Ho} and Park, {Woo Chan} and Kang, {Yoon Sig} and Han, {Tack Don}",
year = "2013",
month = "11",
day = "1",
language = "English",
volume = "29",
pages = "1211--1225",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "6",

}

Nah, JH, Park, WC, Kang, YS & Han, TD 2013, 'Ray-box culling for tree structures', Journal of Information Science and Engineering, vol. 29, no. 6, pp. 1211-1225.

Ray-box culling for tree structures. / Nah, Jae Ho; Park, Woo Chan; Kang, Yoon Sig; Han, Tack Don.

In: Journal of Information Science and Engineering, Vol. 29, No. 6, 01.11.2013, p. 1211-1225.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ray-box culling for tree structures

AU - Nah, Jae Ho

AU - Park, Woo Chan

AU - Kang, Yoon Sig

AU - Han, Tack Don

PY - 2013/11/1

Y1 - 2013/11/1

N2 - Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15× faster ray tracing performance and up to 1.22× faster total rendering performance, including tree construction and ray tracing.

AB - Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15× faster ray tracing performance and up to 1.22× faster total rendering performance, including tree construction and ray tracing.

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

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

M3 - Article

AN - SCOPUS:84891595834

VL - 29

SP - 1211

EP - 1225

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 6

ER -