Analyzing Performance of Bounding Volume Hierarchies for Ray Tracing

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.

Grantor dc:publisher

University of Oregon

Year dc:date.issued

2014

Author dc:creator

• Beick, Kevin

• Computer graphics
• Ray tracing
• Bounding volume
• Image rendering
• Graphics
• Tree structure
• Collision detection

Statement dc:rights

• Creative Commons BY-NC-ND 4.0-US

Language dc:language.iso

en_US

Handle dc:identifier.uri

https://hdl.handle.net/1794/19075

OAI record oai:identifier

https://scholarsbank.uoregon.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Ascholarsbank.uoregon.edu%3A1794%2F19075