Aside from the additional axis, how would it be any different than 2d collision?

Take a look at the Gilbert–Johnson–Keerthi distance algorithm

Hi guys, ive made this example pic so you can understand what i need to achieve.
I have a .obj shape ( the woman body) and a group of opengl 3d cubes randomly placed in x/y/z.





What i need to know  is if each cube collides with the .obj shape

How can i achieve this?

Seb.

Don't post duplicate threads, please. You can bump up this topic if you want.
This problem is very hard to solve (personally, I have no ideas, but I am not much into 3D), so don't wonder if you don't get many answers. Perhaps there are Java libraries to do this, google a bit, but don't expect miracles.

I recall reading about an algorithm that is used for things like this, but I can't recall the name.  I know this doesn't help much, but I was searching on faster methods than Barnes-Hut at the time.