box collision

[Kilarin]

Does the minetest lua api have a built in function to quickly and efficiently check if two boxes intersect given minp an maxp for each?

[rubenwardy]

Not that I know of, but the algorithm is pretty easy. If you Google cube-cube collision, you'll find this:

Code: Select all

return (A.min.x <= B.max.x) && 
    (A.max.x >= B.min.x) && 
    (A.min.y <= B.max.y) && 
    (A.max.y >= B.min.y) && 
    (A.min.z <= B.max.z) && 
    (A.max.z >= B.min.z);

[Kilarin]

I was just wondering if there was a super fast implementation, since I seem to be doing a lot of this. :)
But, the old fashioned way is pretty fast in lua, I guess I'll stick to it.

thank you