Implement a top-level BVH. about c-ray

[madmann91]

Note that your "kd-tree" implementation is in fact a BVH already, not a kd-tree. Are you looking for pull requests?

[vkoskiv]

Thanks for the comment @madmann91!

I guess I was a bit confused about the terminology when I made it a few years ago. My thinking with this issue was that, say I have 10,000 instances of an object, each object has their own kd-tree, but the overall set of objects still needs to be iterated with an exponential time complexity.

And yes, I'm more than happy to accept issues and pull requests, just let me know what you'd be interested in working on!
Thanks again for taking a look.

[madmann91]

I'd be interested to provide a simple BVH drop-in replacement for the kd-tree impl. I'll create a pull request when it's in a good state.

[vkoskiv]

@madmann91 Sounds awesome, let's do it!

[vkoskiv]

@madmann91 Oh, and be sure to check out the contributing section on the Wiki, just so we're on the same page. Thanks!

[vkoskiv]

Resolved by 76b3843