N-D closest simplex search
t = tsearchn(X,TRI,XI)
[t,P] = tsearchn(X,TRI,XI)
t = tsearchn(X,TRI,XI) returns the indices t of the enclosing simplex of the Delaunay triangulation TRI for each point in XI. X is an m-by-n matrix, representing m points in N-dimensional space. XI is a p-by-n matrix, representing p points in N-dimensional space. tsearchn returns NaN for all points outside the convex hull of X. tsearchn requires a triangulation TRI of the points X obtained from delaunayn.
[t,P] = tsearchn(X,TRI,XI) also returns the barycentric coordinate P of XI in the simplex TRI. P is a p-by-n+1 matrix. Each row of P is the barycentric coordinate of the corresponding point in XI. It is useful for interpolation.