fast 3d point -> cuboid volume intersection test
Posted
by
user1130477
on Game Development
See other posts from Game Development
or by user1130477
Published on 2012-10-28T17:08:43Z
Indexed on
2012/10/28
17:18 UTC
Read the original article
Hit count: 176
3d
Im trying to test whether a point lies within a 3d volume defined by 8 points. I know I can use the plane equation to check that the signed distance is always -1 for all 6 sides, but does anyone know of a faster way or could point me to some code? Thanks
EDIT: I should add that ideally the test would produce 3 linear interpolation parameters which would lie in the range 0..1 to indicate that the point is within the volume for each axis (since I will have to calculate these later if the point is found to be in the volume)
© Game Development or respective owner