3.8.2: Closest Points

Assume you have two sets of points: say β€œP” and β€œC”. Further imagine you want to have a network that connects each point of the first set with a predefined number of its nearest neighbors in the second set (input β€œN”) or to points in set two that lie within a given distance β€œLDist”. In that case the β€œNearest Neighbor”-component will be the right choice (see fig. 3.8.2.1). It outputs at β€œP” a data tree with branches containing the points of set β€œC” which are closest to the β€œP”-points. The order of branches corresponds to the points in β€œP”. The output β€œi” returns the indexes of the nodes in β€œC”, and β€œD” the distances.

Fig. 3.8.2.1: A grid of points where each point connects to one or two of its nearest neighbors