23.12.2012 Views

MATLAB Function Reference Volume 1: A - E - Bad Request

MATLAB Function Reference Volume 1: A - E - Bad Request

MATLAB Function Reference Volume 1: A - E - Bad Request

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2dsearchn<br />

Purpose n-D nearest point search<br />

Syntax k = dsearchn(X,T,XI)<br />

k = dsearchn(X,T,XI,outval)<br />

k = dsearchn(X,XI)<br />

[k,d] = dsearchn(X,...)<br />

dsearchn<br />

Description k = dsearchn(X,T,XI) returns the indices k of the closest points in X for each<br />

point in XI. X is an m-by-n matrix representing m points in n-D space. XI is a<br />

p-by-n matrix, representing p points in n-D space. T is a numt-by-n+1 matrix, a<br />

tessellation of the data X generated by delaunayn. The output k is a column<br />

vector of length p.<br />

k = dsearchn(X,T,XI,outval) returns the indices k of the closest points in X<br />

for each point in XI, unless a point is outside the convex hull. If XI(J,:) is<br />

outside the convex hull, then K(J) is assigned outval, a scalar double. Inf is<br />

often used for outval. If outval is [], then k is the same as in the case<br />

k = dsearchn(X,T,XI).<br />

k = dsearchn(X,XI) performs the search without using a tessellation. With<br />

large X and small XI, this approach is faster and uses much less memory.<br />

[k,d] = dsearchn(X,...) also returns the distances d to the closest points. d<br />

is a column vector of length p.<br />

See Also tsearch, dsearch, tsearchn, griddatan, delaunayn<br />

2-465

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!