Kdtree2

Kdtree2 is k-d tree implementation by Matthew B. Kennel. The original paper is available at arXiv.

This module provides following data types:

This module provides following routines to create tree and destroy them.

Following methods are available for getting n-nearest neighbours.

Following methods are available for getting neighbours within radius r.

Following methods are available for counding points within radius r.

All methods

The structure of Kdtree2_ is given below.

It denotes a node of Kdtree2_ k-d tree.

It contains the pair of value and index.

Create the actual tree structure by giving an input array of data.

Destroy the k-d tree.

Find the 'nn' vectors in the tree nearest to 'qv' in euclidean norm

Find the nn vectors in the tree nearest to point idxin,

Count the number of neighbors within square distance 'r2'.

Count the number of neighbors within square distance 'r2'.

Find the nearest neighbors to point 'idxin', within SQUARED

Like Kdtree2rnearest, but around a point 'idxin' already existing in the data set.