point inside irregular cube

#1

Hi,

i was wondering what the best and fastest way is to test if a point lies inside a concave irregular cube ?

any input for this would be much appreciated.

thanks,
Chris

#2

I don’t know if it exists better algorithms but you could take a look to BSP trees. It will partition your concave polyhedra in convex volumes and them it will let you know if a point is inside of one of this volumes.

If your geometry is not too dense you could even calculate the tree in real time.

#3

This thread has been automatically closed as it remained inactive for 12 months. If you wish to continue the discussion, please create a new thread in the appropriate forum.