Title page for etd-0803118-224153


[Back to Results | New Search]

URN etd-0803118-224153
Author Yu-Ren Yeah
Author's Email Address No Public.
Statistics This thesis had been viewed 5572 times. Download 0 times.
Department Computer Science and Engineering
Year 2018
Semester 1
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Traversal and Intersection Acceleration of Ray-Tracing based on Coherence of Neighboring Rays
Date of Defense 2018-08-16
Page Count 54
Keyword
  • 3D graphics
  • Ray-tracing
  • BVH
  • tree traversal
  • ray intersection
  • Abstract This thesis presents an efficient prediction-based ray-tracing scheme in order to accelerate rendering of high-fidelity three-dimensional (3D) graphics scenes. Since the neighboring rays normally exhibit high coherence, they will have similar traversal footprint of the tree structure of the graphics scenes, or even intersect the same triangle. Therefore, this thesis first proposes a novel prediction traversal method in order to skip some ray-node intersection tests during the tree-traversal of the current ray based on the traversal result of its previously traced neighboring ray. Our experimental results based on several benchmarks show that the average saving of the ray-node test number is about 34%, which can lead to 18% saving of the overall rendering time based on the pure software implementation. Next, this paper furthers proposes a new compact tree coding structure which can lead to over 10% tree storage reduction. More importantly, this new tree architecture can be applied for our proposed prediction traversal method to achieve more than 40% off-chip memory data amount transmission and 46% bus transaction during the tree traversal. In order to realize the proposed prediction method, normally an on-chip buffer is required to store the prediction flags of each node. In order to save the on-chip buffer capacity, this paper also proposes a ping-pong prediction buffer design whose on-chip buffer size is only l% of the table-based approach. Finally, this paper also uses the nearest triangle hit by the previous ray as the predicted triangle that will be intersected by the current ray. Our simulation results show that not only the ray-node intersection tests can be further reduced, the triangle intersection tests can also be saved.
    Advisory Committee
  • Chung-Ho Chen - chair
  • Shen-Fu Hsiao - co-chair
  • Shiann-Rong Kuang - co-chair
  • Yun-Nan Chang - advisor
  • Files
  • etd-0803118-224153.pdf
  • Indicate in-campus at 99 year and off-campus access at 99 year.
    Date of Submission 2018-09-04

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys