BMA: A Probabilistic Sampling Framework for Accelerated BVH Traversal in Real-Time Ray Tracing

Ray tracing is a fundamental technique in computer graphics that requires highly efficient algorithms to achieve real-time rendering performance. A key bottleneck in this process is the traversal of Bounding Volume Hierarchies (BVHs). This paper introduces BMA (BMH Mapping Algorithm), where BMH stands for a Bounding-Volume Mapping Heuristic. BMA is a sampling-based algorithm designed to accelerate BVH traversal by leveraging probabilistic relationships between rays and BVH nodes. Through a convolution-like operation, the algorithm estimates traversal probabilities, enabling rays to bypass redundant or low-probability nodes. Experimental results demonstrate a significant acceleration in BVH traversal performance, with up to a 150% improvement on test scenes from the McGuire Computer Graphics Archive. The method maintains high visual fidelity, achieving PSNR values above 35 and SSIM values above 0.9. BMA is also compatible with existing acceleration and optimization techniques, making it a practical addition to real-time ray tracing pipelines.