TSTOOL home page | TSTOOL documentation page | TSTOOL link page |

`fnearneigh` is based on the advanced triangle inequality
algorithm ATRIA. However, it does not support approximate
queries. The functionality of `fnearneigh` is almost the same as that of nn_search (cf. Section 6.14), so
`fnearneigh` might become obsolete in future versions of TSTOOL.

**Syntax:**

`[index, distance] = fnearneigh(pointset, query_points, k)``[index, distance] = fnearneigh(pointset, query_indices, k, exclude)`

**Input arguments:**

`pointset`- a`N`by`D`double matrix containing the coordinates of the point set, organized as`N`points of dimension`D``query_points`- a`R`by`D`double matrix containing the coordinates of the query points, organized as`R`points of dimension`D``query_indices`- query points are taken out of the pointset, query_indices is a vector of length`R`which contains the indices of the query points (indices may vary from 1 to N)`k`- number of nearest neighbors to be determined`exclude`- in case the query points are taken out of the pointset, exclude specifies a range of indices which are omitted from search. For example if the index of the query point is 124 and exclude is set to 3, points with indices 121 to 127 are omitted from search. Using exclude = 0 means: exclude self-matches

**Output arguments:**

`index`- a matrix of size`R`by`k`which contains the indices of the nearest neighbors. Each row of index contains`k`indices of the nearest neighbors to the corresponding query point.`distance`- a matrix of size`R`by`k`which contains the distances of the nearest neighbors to the corresponding query points, sorted in increasing order.

Copyright © 1997-2009 DPI Göttingen