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. 126.96.36.199). 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.