An Improved Ray Tracing Acceleration Algorithm Based on Bounding Volume Hierarchies

TL;DR

This paper introduces an improved BVH-based ray tracing acceleration algorithm that reduces unnecessary intersection tests and enhances computational efficiency by 20-35% compared to traditional methods.

Contribution

The paper proposes a novel BVH algorithm that incorporates surface area heuristic and spatial distance, addressing limitations of existing spatial division methods.

Findings

Improves computation efficiency by 20-35%.

Effectively reduces unnecessary intersection tests.

Maintains computation accuracy.

Abstract

Ray tracing is an efficient channel modeling method. However, the traditional ray tracing method has high computation complexity. To solve this problem, an improved bounding volume hierarchies (BVH) algorithm is proposed in this paper. Based on surface area heuristic (SAH) and spatial distance, the proposed algorithm can effectively reduce the number of unnecessary intersection tests between ray and triangular facets. In addition, the algorithm fully considers the influence of ray action range, which can not only make up for the defects of spatial division based on uniform grid method and k-dimensional (KD) tree, but also solve the problem of unsatisfactory spatial division based on traditional BVH algorithm. The simulation results show that compared with the traditional BVH algorithm, the proposed algorithm can improve the computation efficiency by 20% to 35% while ensuring the computation accuracy.