Fast Parallel Bounding Volume Hierarchy Construction

Our algorithm optimized the parallel structure and speeded up the parallel construction based on the locally-ordered clustering to build the bounding volume hierarchy (BVH). We use the bottom-up approach to build the BVH, merging nearest clusters and subnearest clusters in each iteration. Our algorithm was verified in CUDA and evaluated in GPU ray tracing scenarios. Compared with other methods, our method is more efficient in building rate and effectively generates a more balanced BVH under complex scenarios.