Analyzing Performance of Bounding Volume Hierarchies for Ray Tracing

dc.contributor.authorBeick, Kevin
dc.date.accessioned2015-08-10T18:55:23Z
dc.date.available2015-08-10T18:55:23Z
dc.date.issued2014-12
dc.description39 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.en_US
dc.description.abstractA 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
dc.identifier.urihttps://hdl.handle.net/1794/19075
dc.language.isoen_USen_US
dc.publisherUniversity of Oregonen_US
dc.rightsCreative Commons BY-NC-ND 4.0-USen_US
dc.subjectComputer graphicsen_US
dc.subjectRay tracingen_US
dc.subjectBounding volumeen_US
dc.subjectImage renderingen_US
dc.subjectGraphicsen_US
dc.subjectTree structureen_US
dc.subjectCollision detectionen_US
dc.titleAnalyzing Performance of Bounding Volume Hierarchies for Ray Tracingen_US
dc.typeThesis / Dissertationen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Thesis Final-Beick.pdf
Size:
595.05 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.23 KB
Format:
Item-specific license agreed upon to submission
Description: