title: Find if a point is inside a convex hull for a set of points without computing the hull itself
body: <p>What is the simplest way to test if a point P is inside a convex hull formed by a set of points X? </p>
  
  <p>I'd like an algorithm that works in a high-dimensional space (say, up to 40 dimensions) that doesn't explicitly compute the convex hull itself.  Any ideas?</p>