Thread Subject: fastest way to determent if a point exists in a specific space

Hallo to everybody,

I know that this is not a Matlab specific problem (therefore I would like to apologize in advance) but there may be specific Matlab functions that accelerate the situation.

I'm trying to figure out a way, how to determine if a point with coordinates (Xf,Yf,Zf) exists in a linear hexaeder (a "cube" with unequal surfaces). A linear hexaeder is defined by 8 points in space (x1,y1,z1; x2,y2;z2 ....) and has (like a cube) 6 surfaces.

Is there any way to do that fast? What would be an efficient strategy? My problem is that I have to do it for millions of points and for millions of hexaeders, where each point has to be with each hexaeder individually tested..

Many thanks for your help

Sincerely
Yannis