# 3.8.2: 最近点 (Closest Points)

假设用户有两个点集：**“P”**和**“C”**。再设想一下，当用户想要拥有一个网络时，将第一个点集的每个点连接到第二个点集中预定义数量的最邻近点（输入**“N”**），或第二个点集中给定距离**“LDist（极限距离）”**内的点。这种情况下，**“Nearest Neighbor（最邻近点）”**运算器将是正确的选择（如图3.8.2.1）。该运算器在**“P”**输出一个数据树，该数据树的分支包含最接近**“P”**点的 **“C”**点集中的点。分支的顺序对应于**“P”**中的点。其输出**“i”**反馈**“C”**中节点的索引，**“D”**则反馈距离。

![图3.8.2.1：一个由点构成的网格，其中每个点都连接到其最近的一个或两个相邻点。](/files/-M9XuSNzyRuCOk0uVeEQ)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://manual-1-3.karamba3d.com/chinese_1_3_3/3-in-depth-component-reference/3.8-utilities/3.8.2-closest-points.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.