tsearchn - N-D closest simplex search

Syntax

t = tsearchn(X,TES,XI)
[t,P] = tsearchn(X,TES,XI)

Description

t = tsearchn(X,TES,XI) returns the indices t of the enclosing simplex of the Delaunay tessellation TES 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 tessellation TES of the points X obtained from delaunayn.

[t,P] = tsearchn(X,TES,XI) also returns the barycentric coordinate P of XI in the simplex TES. 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.

Algorithm

tsearchn is based on Qhull [1]. For information about Qhull, see http://www.qhull.org/. For copyright information, see http://www.qhull.org/COPYING.txt.

See Also

delaunayn, griddatan, tsearch

Reference

[1] Barber, C. B., D.P. Dobkin, and H.T. Huhdanpaa, "The Quickhull Algorithm for Convex Hulls," ACM Transactions on Mathematical Software, Vol. 22, No. 4, Dec. 1996, p. 469-483.

  


 © 1984-2008- The MathWorks, Inc.    -   Site Help   -   Patents   -   Trademarks   -   Privacy Policy   -   Preventing Piracy   -   RSS