Hi,

I would search for "Point location", "Point containment", also some

"point in polygon" algorithms can be easily generalized to 3D (e.g.,

winding number, ray-casting).

Jindra

Adam Teasdale Hartshorne wrote:

> Hi All,

>

> I am looking for an efficient way of calculating if a point in 3d space

> is inside or outside a given closed mesh, and where abouts on the mesh

> it intersects (which face or nearest mesh vertex is fine).

>

> Adam