BVH Split Strategies for Fast Distance Queries

R. Ytterlid, E. Shellshear, Journal of Computer Graphics Techniques (JCGT), vol. 4, no. 1, 1-25, 2015


This paper presents a number of strategies focused on improving bounding volume hierarchies (BVHs) to accelerate distance queries. We present two classes of BVH split strategies that are designed specifically for fast distance queries, but also work well for collision detection and we compare their performance to existing strategies as well as the new ones introduced here. The classes of split strategies improve distance query performance by constructing a BVH to provide better SSE-utilization during proximity queries and also improve the quality of bounding volumes of the BVH. When combined with each other, our two approaches can offer up to five times better distance query performance and twice as fast collision queries than standard split methods


Authors and Affiliations

  • R. Ytterlid, Fraunhofer-Chalmers Centre
  • E. Shellshear, Fraunhofer-Chalmers Centre

Photo credits: Nic McPhee