SIMDop: SIMD optimized Bounding Volume Hierarchies for Collision Detection

We present a novel data structure for SIMD optimized simultaneous bounding volume hierarchy (BVH) traversals like they appear for instance in collision detection tasks. In contrast to all previous approaches, we consider both the traversal algorithm and the construction of the BVH. The main idea is to increase the branching factor of the BVH according to the available SIMD registers and parallelize the simultaneous BVH traversal using SIMD operations. This requires a novel BVH construction method because traditional BVHs for collision detection usually are simple binary trees. To do that, we present a new BVH construction method based on a clustering algorithm, Batch Neural Gas, that is able to build efficient n-ary tree structures along with SIMD optimized simultaneous BVH traversal. Our results show that our new data structure outperforms binary trees significantly.

[1]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[2]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[3]  Dinesh Manocha,et al.  Spherical shell: a higher order bounding volume for fast proximity queries , 1998 .

[4]  Gabriel Zachmann,et al.  Minimal hierarchical collision detection , 2002, VRST '02.

[5]  S. Kolski,et al.  Detection, prediction, and avoidance of dynamic obstacles in urban environments , 2008, 2008 IEEE Intelligent Vehicles Symposium.

[6]  Dinesh Manocha,et al.  Rapid and Accurate Contact Determination between Spline Models using ShellTrees , 1998, Comput. Graph. Forum.

[7]  Taosong He,et al.  Fast collision detection using QuOSPO trees , 1999, SI3D.

[8]  I. Wald,et al.  On fast Construction of SAH-based Bounding Volume Hierarchies , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[9]  Gabriel Zachmann,et al.  Geometric data structures for computer graphics , 2002, Eurographics.

[10]  Stefano Caselli,et al.  An experimental evaluation of collision detection packages for robot motion planning , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Roland Siegwart,et al.  Fast collision detection through bounding volume hierarchies in workspace-time space for sampling-based motion planners , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[13]  Stefan Kimmerle,et al.  Hierarchical Techniques in Collision Detection for Cloth Animation , 2003, WSCG.

[14]  M. Levas.  OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[15]  Dinesh Manocha,et al.  Fast BVH Construction on GPUs , 2009, Comput. Graph. Forum.

[16]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[17]  Dinesh Manocha,et al.  FCL: A general purpose library for collision and proximity queries , 2012, 2012 IEEE International Conference on Robotics and Automation.

[18]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[19]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[20]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[21]  Gabriel Zachmann,et al.  Massively Parallel Batch Neural Gas for Bounding Volume Hierarchy Construction , 2014, VRIPHYS.

[22]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[23]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[24]  René Weller.  A Benchmarking Suite for Static Collision Detection Algorithms , 2007 .

[25]  Gabriel Zachmann,et al.  Virtual reality in assembly simulation: collision detection, simulation algorithms, and interaction techniques , 2000 .

[26]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[27]  Leonidas J. Guibas,et al.  Collision detection for deforming necklaces , 2002, SCG '02.