本文整理汇总了C++中pcl::search::KdTree::setSortedResults方法的典型用法代码示例。如果您正苦于以下问题：C++ KdTree::setSortedResults方法的具体用法？C++ KdTree::setSortedResults怎么用？C++ KdTree::setSortedResults使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类pcl::search::KdTree的用法示例。
在下文中一共展示了KdTree::setSortedResults方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: return
/* ---[ */
int
main (int argc, char** argv)
{
if (argc < 2)
{
std::cout << "need path to table_scene_mug_stereo_textured.pcd file\n";
return (-1);
}
pcl::io::loadPCDFile (argv [1], *organized_sparse_cloud);
// create unorganized cloud
unorganized_dense_cloud->resize (unorganized_point_count);
unorganized_dense_cloud->height = 1;
unorganized_dense_cloud->width = unorganized_point_count;
unorganized_dense_cloud->is_dense = true;
unorganized_sparse_cloud->resize (unorganized_point_count);
unorganized_sparse_cloud->height = 1;
unorganized_sparse_cloud->width = unorganized_point_count;
unorganized_sparse_cloud->is_dense = false;
PointXYZ point;
for (unsigned pIdx = 0; pIdx < unorganized_point_count; ++pIdx)
{
point.x = rand_float ();
point.y = rand_float ();
point.z = rand_float ();
unorganized_dense_cloud->points [pIdx] = point;
if (rand_uint () == 0)
unorganized_sparse_cloud->points [pIdx].x = unorganized_sparse_cloud->points [pIdx].y = unorganized_sparse_cloud->points [pIdx].z = std::numeric_limits<float>::quiet_NaN ();
else
unorganized_sparse_cloud->points [pIdx] = point;
}
unorganized_grid_cloud->reserve (1000);
unorganized_grid_cloud->height = 1;
unorganized_grid_cloud->width = 1000;
unorganized_grid_cloud->is_dense = true;
// values between 0 and 1
for (unsigned xIdx = 0; xIdx < 10; ++xIdx)
{
for (unsigned yIdx = 0; yIdx < 10; ++yIdx)
{
for (unsigned zIdx = 0; zIdx < 10; ++zIdx)
{
point.x = 0.1f * static_cast<float>(xIdx);
point.y = 0.1f * static_cast<float>(yIdx);
point.z = 0.1f * static_cast<float>(zIdx);
unorganized_grid_cloud->push_back (point);
}
}
}
createIndices (organized_input_indices, static_cast<unsigned> (organized_sparse_cloud->size () - 1));
createIndices (unorganized_input_indices, unorganized_point_count - 1);
brute_force.setSortedResults (true);
KDTree.setSortedResults (true);
octree_search.setSortedResults (true);
organized.setSortedResults (true);
unorganized_search_methods.push_back (&brute_force);
unorganized_search_methods.push_back (&KDTree);
unorganized_search_methods.push_back (&octree_search);
organized_search_methods.push_back (&brute_force);
organized_search_methods.push_back (&KDTree);
organized_search_methods.push_back (&octree_search);
organized_search_methods.push_back (&organized);
createQueryIndices (unorganized_dense_cloud_query_indices, unorganized_dense_cloud, query_count);
createQueryIndices (unorganized_sparse_cloud_query_indices, unorganized_sparse_cloud, query_count);
createQueryIndices (organized_sparse_query_indices, organized_sparse_cloud, query_count);
testing::InitGoogleTest (&argc, argv);
return (RUN_ALL_TESTS ());
}