Algorithms and structures of spatial partitioning kd-tree, BVH are considered and studied in relation to the problem of modeling the flow of air around a body of complex shape. The use of these algorithms makes it possible to significantly reduce the computation time when searching for collisions of air particles with each other and with a streamlined body.

Keywords: collision detection, computational geometry, data structures and algorithms, kd-tree, BVH