What is the best method for finding the closest point on a tetrahedron to a point? I've implemented a method for finding the closest point on a triangle to point using voronoi regions, should i just find the closest point on each of the triangles and return the point on the triangle that has the shortest distance to my test point? Seems like there should be a better way.
↧