Documentation Center |
Class: KDTreeSearcher
Find all neighbors within specified distance using KDTreeSearcher object
idx = rangesearch(NS,Y,r)
[idx,D]=
rangesearch(NS,Y,r)
[idx,D]=
rangesearch(NS,Y,r,Name,Value)
idx = rangesearch(NS,Y,r) finds all points in NS.X that are within distance r of the Y points. Rows of NS.X and Y correspond to observations, and columns correspond to variables.
[idx,D]= rangesearch(NS,Y,r) returns the distances between each row of Y and the rows of NS.X that are r or less distant.
[idx,D]= rangesearch(NS,Y,r,Name,Value) finds nearby points with additional options specified by one or more Name,Value pair arguments.
For a fixed positive integer K, knnsearch finds the K points in NS.X that are nearest each Y point. In contrast, for a fixed positive real value r, rangesearch finds all the points in NS.X that are within a distance r of each Y point.
NS |
KDTreeSearcher object, constructed using KDTreeSearcher or createns. |
Y |
my-by-n numeric matrix, where each row represents one n-dimensional point. The number of columns n must equal the number of columns in NS.X. |
r |
Search radius, a scalar. rangesearch finds all NS.X points (rows) that are within distance r of each Y point. The meaning of distance depends on the Distance name-value pair. |
Specify optional comma-separated pairs of Name,Value arguments. Name is the argument name and Value is the corresponding value. Name must appear inside single quotes (' '). You can specify several name and value pair arguments in any order as Name1,Value1,...,NameN,ValueN.
'Distance' |
String or function handle specifying the distance metric.
For definitions, see Distance Metrics. Default: NS.Distance | ||||||||||
'P' |
Positive scalar indicating the exponent of Minkowski distance. This argument is only valid when the Distance name-value pair is 'minkowski'. Default: 2 |
idx |
my-by-1 cell array, where my is the number of rows in Y. idx{I} contains the indices of points (rows) in NS.X whose distances to Y(I,:) are not greater than r. The entries in idx{I} are in ascending order of distance. |
D |
my-by-1 cell array, where my is the number of rows in Y. D{I} contains the distance values between Y(I,:) and the corresponding points in idx{I}. |
Create X and Y as samples of 5-D normally distributed variables. Create a KDTreeSearcher object NS from X. Find the points in NS.X that are within a Euclidean distance 1.5 of each point in Y.
rng('default') % for reproducibility X = randn(100,5); Y = randn(10,5); NS = KDTreeSearcher(X); [idx, dist] = rangesearch(NS,Y,1.5) idx = [1x7 double] [1x2 double] [1x11 double] [1x2 double] [1x12 double] [1x9 double] [ 89] [1x0 double] [1x0 double] [1x0 double] dist = [1x7 double] [1x2 double] [1x11 double] [1x2 double] [1x12 double] [1x9 double] [ 1.1739] [1x0 double] [1x0 double] [1x0 double]
In this case, the last three points in Y are more than 1.5 distant from any point in NS.X. NS.X(89,:) is 1.1739 distant from Y(7,:), and there is no other point in NS.X that is within distance 1.5 of Y(7,:). There are 12 points in NS.X within distance 1.5 of Y(5,:).
rangesearch is the KDTreeSearcher method for distance search. It is equivalent to the rangesearch function with the NSMethod name-value pair set to 'kdtree'.
rangesearch is the ExhaustiveSearcher method for distance search. It is equivalent to the rangesearch function with the NSMethod name-value pair set to 'exhaustive'.
createns | KDTreeSearcher | knnsearch | pdist2 | rangesearch