This paper discusses the basics of ray tracing and the limitations that arise when trying to implement it. Concerned with the efficiency of intersection tests and the triangle representation within various bounding boxes, this paper explores how using a bounding volume hierarchy paired with discretely rotated oriented bounding boxes and memory optimization through k-DOP proxies can drastically improve the performance of a ray tracing algorithm.