The algorithm builds BoxTreees of arbitrary non convex polyhedra using a hierarchical adaptive space subdivision scheme, and speeds up collision detection by traversing the BoxTrees in parallel.