> For the complete documentation index, see [llms.txt](https://manual-2.karamba3d.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://manual-2.karamba3d.com/3-in-depth-component-reference/3.8-utilities/3.8.2-closest-points.md).

# 3.9.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.9.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.9.2.1: A grid of points where each point connects to one or two of its nearest neighbors](/files/-MCkE_rLBK9Fq4gB3LWq)

{% file src="/files/RcFl0O5mGOd0o0qaXrb5" %}

{% file src="/files/s2IhwAOprENndcXi1O03" %}