The infinite distance in the determination of the nearest Euclidean M-neighbours in the K-D-B tree

A search scheme of the nearest m-neighbors in the K-D-B tree structure is proposed. In this scheme, two different strategies for the selection of alternative descent branches, which determine the order in which the criticism of the pruning tree is studied, are devised. An experimental study of this was performed using the infinite distance and Euclidean distance. The low cost of the infinite distance approach with respect to the Euclidean and the inclusion relation that exists between hyperspheres of equal radius are conducive to the study of the search problem of the Euclidean m-neighbors using the infinite distance as filter.<
>