A parallel construction method based on linear hierarchical bounding box without stack

Abstract

The intersect operation of geometry is a common method of collision detection. To achieve a fast intersect operation, a hierarchical bounding box must be quickly constructed. This paper proposes an effective space division method for constructing high-quality linear hierarchical bounding boxes through ray tracing. This method can generate more regular axial bounding boxes into a complete binary tree. This structure can be completely parallel on the GPU, and effective parallelization can ensure the fastest tree-building time. The algorithm in this paper uses a non-stack ray tracing method to increase the frame rate of the 3D model rendering in the graphics processing unit and reduce the construction time of the bounding box. The experimental analysis of construction time, frame rate, average number of intersections and other performance indicators, the experimental results show that the use of stack-free midpoint splitting method and surface heuristic splitting method to ensure rapid construction time and efficient ray traversal performance, improve the object’s light traversal efficiency.