@@ -2513,7 +2513,7 @@ class CV_EXPORTS Octree{
25132513 Ptr<OctreeNode>index (Point3f point, Ptr<OctreeNode>& node)const ;
25142514
25152515/* * @overload
2516- * @brief The default search range is in the entire tree.
2516+ * @brief The default search range is in the entire tree.
25172517 * @param point
25182518 * @return The pointer to the located OctreeNode.
25192519*/
@@ -2539,7 +2539,7 @@ class CV_EXPORTS Octree{
25392539void traverseRecurseDFS ( Ptr<OctreeNode>& node,const std::function<bool ( Ptr<OctreeNode>&)>&f );
25402540
25412541/* * @brief Radius Nearest Neighbor Search in Octree
2542- * Search all points that are less than or equal to radius from thequery point .
2542+ * Search all points that are less than or equal to radius from thegiven octree node .
25432543 * And return the number of searched points.
25442544 * @param node The input OctreeNode.
25452545 * @param query Query point.
@@ -2550,11 +2550,20 @@ class CV_EXPORTS Octree{
25502550*/
25512551static int radiusNNSearch (Ptr<OctreeNode>& node, Point3f query,float radius, std::vector<Point3f>& pointSet, std::vector<float >& squareDistSet);
25522552
2553- // ! overload
2553+ /* * @overload
2554+ * @brief Radius Nearest Neighbor Search in Octree
2555+ * Search all points that are less than or equal to radius from the query point.
2556+ * And return the number of searched points.
2557+ * @param query Query point.
2558+ * @param radius Retrieved radius value.
2559+ * @param pointSet Contains searched points, and output vector is not in order.
2560+ * @param distSet Contains searched squared distance, and output vector is not in order.
2561+ * @return the number of searched points.
2562+ */
25542563int radiusNNSearch (Point3f query,float radius, std::vector<Point3f>& pointSet, std::vector<float >& squareDistSet);
25552564
25562565/* * @brief K Nearest Neighbor Search in Octree.
2557- *
2566+ * Find the K nearest neighbors to the query point from the given octree node.
25582567 * @param node The input OctreeNode.
25592568 * @param query Query point.
25602569 * @param K
@@ -2563,7 +2572,14 @@ class CV_EXPORTS Octree{
25632572*/
25642573static void KNNSearch (Ptr<OctreeNode>& node, Point3f query,int K, std::vector<Point3f>& pointSet, std::vector<float >& squareDistSet);
25652574
2566- // ! overload
2575+ /* * @overload
2576+ * @brief K Nearest Neighbor Search in Octree.
2577+ * Find the K points nearest to the query point from the octree.
2578+ * @param query Query point.
2579+ * @param K
2580+ * @param pointSet Contains K points, arranged in order of distance from near to far.
2581+ * @param squareDistSet Contains K squared distance, arranged in order of distance from near to far.
2582+ */
25672583void KNNSearch (Point3f query,int K, std::vector<Point3f>& pointSet, std::vector<float >& squareDistSet);
25682584
25692585// ! The pointer to Octree root node.
@@ -2613,7 +2629,7 @@ CV_EXPORTS_W bool octreeFromPointCloud(std::vector<Point3f> &pointCloud, Octree&
26132629 * @param query Query point.
26142630 * @param radius Retrieved radius value.
26152631 * @param pointSet Contains searched points, and output vector is not in order.
2616- * @paramdistSet Contains searched squared distance, and output vector is not in order.
2632+ * @paramsquareDistSet Contains searched squared distance, and output vector is not in order.
26172633 * @return the number of searched points.
26182634*/
26192635CV_EXPORTS_Wint octreeRadiusNNSearch (Octree& octree, Point3f query,float radius, std::vector<Point3f>& pointSet, std::vector<float >& squareDistSet);
@@ -2622,7 +2638,6 @@ CV_EXPORTS_W int octreeRadiusNNSearch(Octree& octree, Point3f query, float radiu
26222638/* * @brief K Nearest Neighbor Search in Octree.
26232639 *
26242640 * @param octree The input Octree instance.
2625- * @param node The input Octree instance.
26262641 * @param query Query point.
26272642 * @param K
26282643 * @param pointSet Contains K points, arranged in order of distance from near to far.