2026-09-18T17:10:44Zhttps://scholarsbank.uoregon.edu/server/oai/request

oai:scholarsbank.uoregon.edu:1794/190752024-10-21T21:12:35Zcom_1794_7557com_1794_7555com_1794_7552col_1794_169

Beick, Kevin 2015-08-10T18:55:23Z 2015-08-10T18:55:23Z 2014-12 https://hdl.handle.net/1794/19075 39 pages. A thesis presented to the Department of Computer and Information Science and the Clark Honors College of the University of Oregon in partial fulfillment of the requirements for degree of Bachelor of Arts, Fall 2014. A Bounding Volume Hierarchy — a type of informational data structure commonly used in computer graphics — is a popular means of accelerating the ray tracing algorithm used to render 3D images. There are many possible variations to consider when implementing a BVH for a particular ray tracing project. The goal of this thesis is to gain an understanding of how a few of the most significant design decisions affect a BVH’s performance. To gain a thorough understanding of the internal mechanics of BVHs, I wrote and assembled my own codebase that records runtime metrics during the execution of the ray tracing algorithm. en_US University of Oregon Creative Commons BY-NC-ND 4.0-US Computer graphics Ray tracing Bounding volume Image rendering Graphics Tree structure Collision detection Analyzing Performance of Bounding Volume Hierarchies for Ray Tracing Thesis / Dissertationopen.access