Holiday notice: Cycling '74 will be closed Monday, October 9th. Manual authorization, support cases, and manual order processing will be delayed.

Aug 05 2006 | 1:28 pm

If I have N points in 3D space these will form some sort of a volume,
assuming that they are not all on the same plane or line. Some points
might be inside the volume while others will be defining the various
edges of the volume.

My question is, do anyone know of any general and efficient algorithm
for determining if another point is inside or outside of this volume,
and if it is positioned outside the volume how to determine the shortest
distance from the point onto the surface of the volume, and the position
of the projection of the point onto the surface?

Thanks,
Trond