[Closed] Do 2 BoundingBoxes Intersect

not even close i’m afraid…

and the kdtree is also finding the median during the build… also the qkdtree seems to have a clean up issue

Thanks for testing it!
Should have mentioned that I only borrowed the build algorithm idea and did my tests in mxs version of kdtree. And this non-recursive approach performs a little better but still not good enough. I posted my code in another thread

the “likes recursion” wasn’t really a reference to performance but the way it (trees) lends its self to the coding