Divide and Conquer Ray Tracing Algorithm Based on BVH Partition

Abstract

A new fast divide and conquer ray tracing algorithm based on BVH partition which can remove unnecessary rays in subspace is proposed to resolve the problem that bounding boxes not tightly surround the primitives by space divide scheme which then increased unnecessary rays in subspace. Its core idea is that using Bin based BVH construction algorithm to partition primitives into two parts then distributing primitives and rays into corresponding subspace using stream filter. If the number of rays and primitives which intersect a sub space meet some limit condition, the primitives and rays in the subspace then begin basic ray tracing. A comparison between divide conquer ray tracing algorithm using BVH and using space divide schemes such as Kd-tree, grid shows our method can reduce computing with unnecessary rays in subspace substantially and lead to faster performance significantly.