基于181pcl库求kdtree内点pxyz索引的c++代码

以下是基于1.8.1版本的PCL库，使用KDTree进行点云索引的C++代码示例：

#include <iostream>
#include <pcl/point_types.h>
#include <pcl/kdtree/kdtree_flann.h>

int main()
{
    // 创建点云数据
    pcl::PointCloud<pcl::PointXYZ>::Ptr cloud(new pcl::PointCloud<pcl::PointXYZ>);
    cloud->width = 5;
    cloud->height = 1;
    cloud->points.resize(cloud->width * cloud->height);
    cloud->points[0].x = 0.0;
    cloud->points[0].y = 0.0;
    cloud->points[0].z = 0.0;
    cloud->points[1].x = 1.0;
    cloud->points[1].y = 1.0;
    cloud->points[1].z = 1.0;
    cloud->points[2].x = 2.0;
    cloud->points[2].y = 2.0;
    cloud->points[2].z = 2.0;
    cloud->points[3].x = 3.0;
    cloud->points[3].y = 3.0;
    cloud->points[3].z = 3.0;
    cloud->points[4].x = 4.0;
    cloud->points[4].y = 4.0;
    cloud->points[4].z = 4.0;

    // 创建KDTree对象
    pcl::KdTreeFLANN<pcl::PointXYZ> kdtree;
    kdtree.setInputCloud(cloud);

    // 设置查询点
    pcl::PointXYZ searchPoint;
    searchPoint.x = 2.5;
    searchPoint.y = 2.5;
    searchPoint.z = 2.5;

    // 最近邻搜索
    int K = 1; // 返回最近邻的个数
    std::vector<int> pointIdxNKNSearch(K);
    std::vector<float> pointNKNSquaredDistance(K);

    if (kdtree.nearestKSearch(searchPoint, K, pointIdxNKNSearch, pointNKNSquaredDistance) > 0)
    {
        for (size_t i = 0; i < pointIdxNKNSearch.size(); ++i)
            std::cout << "最近邻点索引: " << pointIdxNKNSearch[i] << " 距离: " << pointNKNSquaredDistance[i] << std::endl;
    }

    return 0;
}

请注意，此示例中的点云数据仅用于演示，您需要根据您的实际数据进行相应的修改。