42 #include <pcl/common/point_tests.h>
43 #include <pcl/octree/impl/octree_base.hpp>
50 typename LeafContainerT,
51 typename BranchContainerT,
59 , resolution_(resolution)
66 , bounding_box_defined_(false)
67 , max_objs_per_leaf_(0)
69 assert(resolution > 0.0f);
74 typename LeafContainerT,
75 typename BranchContainerT,
82 for (
const auto& index : *indices_) {
83 assert((index >= 0) && (
static_cast<std::size_t
>(index) < input_->size()));
87 this->addPointIdx(index);
92 for (
index_t i = 0; i < static_cast<index_t>(input_->size()); i++) {
102 template <
typename PointT,
103 typename LeafContainerT,
104 typename BranchContainerT,
110 this->addPointIdx(point_idx_arg);
112 indices_arg->push_back(point_idx_arg);
116 template <
typename PointT,
117 typename LeafContainerT,
118 typename BranchContainerT,
124 assert(cloud_arg == input_);
126 cloud_arg->push_back(point_arg);
128 this->addPointIdx(cloud_arg->size() - 1);
132 template <
typename PointT,
133 typename LeafContainerT,
134 typename BranchContainerT,
142 assert(cloud_arg == input_);
143 assert(indices_arg == indices_);
145 cloud_arg->push_back(point_arg);
147 this->addPointFromCloud(cloud_arg->size() - 1, indices_arg);
151 template <
typename PointT,
152 typename LeafContainerT,
153 typename BranchContainerT,
159 if (!isPointWithinBoundingBox(point_arg)) {
166 this->genOctreeKeyforPoint(point_arg, key);
169 return (this->existLeaf(key));
173 template <
typename PointT,
174 typename LeafContainerT,
175 typename BranchContainerT,
182 const PointT& point = (*this->input_)[point_idx_arg];
185 return (this->isVoxelOccupiedAtPoint(point));
189 template <
typename PointT,
190 typename LeafContainerT,
191 typename BranchContainerT,
196 const double point_y_arg,
197 const double point_z_arg)
const
201 point.x = point_x_arg;
202 point.y = point_y_arg;
203 point.z = point_z_arg;
206 return (this->isVoxelOccupiedAtPoint(point));
210 template <
typename PointT,
211 typename LeafContainerT,
212 typename BranchContainerT,
218 if (!isPointWithinBoundingBox(point_arg)) {
225 this->genOctreeKeyforPoint(point_arg, key);
227 this->removeLeaf(key);
232 typename LeafContainerT,
233 typename BranchContainerT,
240 const PointT& point = (*this->input_)[point_idx_arg];
243 this->deleteVoxelAtPoint(point);
247 template <
typename PointT,
248 typename LeafContainerT,
249 typename BranchContainerT,
256 key.
x = key.
y = key.
z = 0;
258 voxel_center_list_arg.clear();
260 return getOccupiedVoxelCentersRecursive(this->root_node_, key, voxel_center_list_arg);
264 template <
typename PointT,
265 typename LeafContainerT,
266 typename BranchContainerT,
271 const Eigen::Vector3f& end,
275 Eigen::Vector3f direction = end - origin;
276 float norm = direction.norm();
277 direction.normalize();
279 const float step_size =
static_cast<float>(resolution_) * precision;
281 const auto nsteps = std::max<std::size_t>(1, norm / step_size);
285 bool bkeyDefined =
false;
288 for (std::size_t i = 0; i < nsteps; ++i) {
289 Eigen::Vector3f p = origin + (direction * step_size *
static_cast<float>(i));
297 this->genOctreeKeyforPoint(octree_p, key);
300 if ((key == prev_key) && (bkeyDefined))
307 genLeafNodeCenterFromOctreeKey(key, center);
308 voxel_center_list.push_back(center);
316 this->genOctreeKeyforPoint(end_p, end_key);
317 if (!(end_key == prev_key)) {
319 genLeafNodeCenterFromOctreeKey(end_key, center);
320 voxel_center_list.push_back(center);
323 return (
static_cast<uindex_t>(voxel_center_list.size()));
327 template <
typename PointT,
328 typename LeafContainerT,
329 typename BranchContainerT,
336 double minX, minY, minZ, maxX, maxY, maxZ;
342 assert(this->leaf_count_ == 0);
346 float minValue = std::numeric_limits<float>::epsilon() * 512.0f;
352 maxX = max_pt.x + minValue;
353 maxY = max_pt.y + minValue;
354 maxZ = max_pt.z + minValue;
357 defineBoundingBox(minX, minY, minZ, maxX, maxY, maxZ);
361 template <
typename PointT,
362 typename LeafContainerT,
363 typename BranchContainerT,
368 const double min_y_arg,
369 const double min_z_arg,
370 const double max_x_arg,
371 const double max_y_arg,
372 const double max_z_arg)
375 assert(this->leaf_count_ == 0);
377 min_x_ = std::min(min_x_arg, max_x_arg);
378 min_y_ = std::min(min_y_arg, max_y_arg);
379 min_z_ = std::min(min_z_arg, max_z_arg);
381 max_x_ = std::max(min_x_arg, max_x_arg);
382 max_y_ = std::max(min_y_arg, max_y_arg);
383 max_z_ = std::max(min_z_arg, max_z_arg);
388 bounding_box_defined_ =
true;
392 template <
typename PointT,
393 typename LeafContainerT,
394 typename BranchContainerT,
399 const double max_y_arg,
400 const double max_z_arg)
403 assert(this->leaf_count_ == 0);
405 min_x_ = std::min(0.0, max_x_arg);
406 min_y_ = std::min(0.0, max_y_arg);
407 min_z_ = std::min(0.0, max_z_arg);
409 max_x_ = std::max(0.0, max_x_arg);
410 max_y_ = std::max(0.0, max_y_arg);
411 max_z_ = std::max(0.0, max_z_arg);
416 bounding_box_defined_ =
true;
420 template <
typename PointT,
421 typename LeafContainerT,
422 typename BranchContainerT,
429 assert(this->leaf_count_ == 0);
431 min_x_ = std::min(0.0, cubeLen_arg);
432 min_y_ = std::min(0.0, cubeLen_arg);
433 min_z_ = std::min(0.0, cubeLen_arg);
435 max_x_ = std::max(0.0, cubeLen_arg);
436 max_y_ = std::max(0.0, cubeLen_arg);
437 max_z_ = std::max(0.0, cubeLen_arg);
442 bounding_box_defined_ =
true;
446 template <
typename PointT,
447 typename LeafContainerT,
448 typename BranchContainerT,
457 double& max_z_arg)
const
469 template <
typename PointT,
470 typename LeafContainerT,
471 typename BranchContainerT,
478 constexpr
float minValue = std::numeric_limits<float>::epsilon();
482 bool bLowerBoundViolationX = (point_arg.x < min_x_);
483 bool bLowerBoundViolationY = (point_arg.y < min_y_);
484 bool bLowerBoundViolationZ = (point_arg.z < min_z_);
486 bool bUpperBoundViolationX = (point_arg.x >= max_x_);
487 bool bUpperBoundViolationY = (point_arg.y >= max_y_);
488 bool bUpperBoundViolationZ = (point_arg.z >= max_z_);
491 if (bLowerBoundViolationX || bLowerBoundViolationY || bLowerBoundViolationZ ||
492 bUpperBoundViolationX || bUpperBoundViolationY || bUpperBoundViolationZ ||
493 (!bounding_box_defined_)) {
495 if (bounding_box_defined_) {
497 double octreeSideLen;
498 unsigned char child_idx;
502 child_idx =
static_cast<unsigned char>(((!bUpperBoundViolationX) << 2) |
503 ((!bUpperBoundViolationY) << 1) |
504 ((!bUpperBoundViolationZ)));
509 this->branch_count_++;
511 this->setBranchChildPtr(*newRootBranch, child_idx, this->root_node_);
513 this->root_node_ = newRootBranch;
515 octreeSideLen =
static_cast<double>(1 << this->octree_depth_) * resolution_;
517 if (!bUpperBoundViolationX)
518 min_x_ -= octreeSideLen;
520 if (!bUpperBoundViolationY)
521 min_y_ -= octreeSideLen;
523 if (!bUpperBoundViolationZ)
524 min_z_ -= octreeSideLen;
527 this->octree_depth_++;
528 this->setTreeDepth(this->octree_depth_);
532 static_cast<double>(1 << this->octree_depth_) * resolution_ - minValue;
535 max_x_ = min_x_ + octreeSideLen;
536 max_y_ = min_y_ + octreeSideLen;
537 max_z_ = min_z_ + octreeSideLen;
542 this->min_x_ = point_arg.x - this->resolution_ / 2;
543 this->min_y_ = point_arg.y - this->resolution_ / 2;
544 this->min_z_ = point_arg.z - this->resolution_ / 2;
546 this->max_x_ = point_arg.x + this->resolution_ / 2;
547 this->max_y_ = point_arg.y + this->resolution_ / 2;
548 this->max_z_ = point_arg.z + this->resolution_ / 2;
552 bounding_box_defined_ =
true;
562 template <
typename PointT,
563 typename LeafContainerT,
564 typename BranchContainerT,
570 unsigned char child_idx,
576 std::size_t leaf_obj_count = (*leaf_node)->getSize();
580 leafIndices.reserve(leaf_obj_count);
582 (*leaf_node)->getPointIndices(leafIndices);
585 this->deleteBranchChild(*parent_branch, child_idx);
589 BranchNode* childBranch = this->createBranchChild(*parent_branch, child_idx);
590 this->branch_count_++;
595 for (
const auto& leafIndex : leafIndices) {
597 const PointT& point_from_index = (*input_)[leafIndex];
599 genOctreeKeyforPoint(point_from_index, new_index_key);
603 this->createLeafRecursive(
604 new_index_key, depth_mask, childBranch, newLeaf, newBranchParent);
606 (*newLeaf)->addPointIndex(leafIndex);
612 template <
typename PointT,
613 typename LeafContainerT,
614 typename BranchContainerT,
622 assert(point_idx_arg < input_->size());
624 const PointT& point = (*input_)[point_idx_arg];
627 adoptBoundingBoxToPoint(point);
630 genOctreeKeyforPoint(point, key);
634 auto depth_mask = this->createLeafRecursive(
635 key, this->depth_mask_, this->root_node_, leaf_node, parent_branch_of_leaf_node);
637 if (this->dynamic_depth_enabled_ && depth_mask) {
639 std::size_t leaf_obj_count = (*leaf_node)->getSize();
641 while (leaf_obj_count >= max_objs_per_leaf_ && depth_mask) {
645 expandLeafNode(leaf_node, parent_branch_of_leaf_node, child_idx, depth_mask);
647 depth_mask = this->createLeafRecursive(key,
651 parent_branch_of_leaf_node);
652 leaf_obj_count = (*leaf_node)->getSize();
656 (*leaf_node)->addPointIndex(point_idx_arg);
660 template <
typename PointT,
661 typename LeafContainerT,
662 typename BranchContainerT,
669 assert(index_arg < input_->size());
670 return ((*this->input_)[index_arg]);
674 template <
typename PointT,
675 typename LeafContainerT,
676 typename BranchContainerT,
682 constexpr
float minValue = std::numeric_limits<float>::epsilon();
685 const auto max_key_x =
686 static_cast<uindex_t>(std::ceil((max_x_ - min_x_ - minValue) / resolution_));
687 const auto max_key_y =
688 static_cast<uindex_t>(std::ceil((max_y_ - min_y_ - minValue) / resolution_));
689 const auto max_key_z =
690 static_cast<uindex_t>(std::ceil((max_z_ - min_z_ - minValue) / resolution_));
693 const auto max_voxels =
694 std::max<uindex_t>(std::max(std::max(max_key_x, max_key_y), max_key_z), 2);
697 this->octree_depth_ = std::max<uindex_t>(
699 std::ceil(std::log2(max_voxels) - minValue)),
702 const auto octree_side_len =
703 static_cast<double>(1 << this->octree_depth_) * resolution_;
705 if (this->leaf_count_ == 0) {
706 double octree_oversize_x;
707 double octree_oversize_y;
708 double octree_oversize_z;
710 octree_oversize_x = (octree_side_len - (max_x_ - min_x_)) / 2.0;
711 octree_oversize_y = (octree_side_len - (max_y_ - min_y_)) / 2.0;
712 octree_oversize_z = (octree_side_len - (max_z_ - min_z_)) / 2.0;
714 assert(octree_oversize_x > -minValue);
715 assert(octree_oversize_y > -minValue);
716 assert(octree_oversize_z > -minValue);
718 if (octree_oversize_x > minValue) {
719 min_x_ -= octree_oversize_x;
720 max_x_ += octree_oversize_x;
722 if (octree_oversize_y > minValue) {
723 min_y_ -= octree_oversize_y;
724 max_y_ += octree_oversize_y;
726 if (octree_oversize_z > minValue) {
727 min_z_ -= octree_oversize_z;
728 max_z_ += octree_oversize_z;
732 max_x_ = min_x_ + octree_side_len;
733 max_y_ = min_y_ + octree_side_len;
734 max_z_ = min_z_ + octree_side_len;
738 this->setTreeDepth(this->octree_depth_);
742 template <
typename PointT,
743 typename LeafContainerT,
744 typename BranchContainerT,
751 key_arg.
x =
static_cast<uindex_t>((point_arg.x - this->min_x_) / this->resolution_);
752 key_arg.
y =
static_cast<uindex_t>((point_arg.y - this->min_y_) / this->resolution_);
753 key_arg.
z =
static_cast<uindex_t>((point_arg.z - this->min_z_) / this->resolution_);
755 assert(key_arg.
x <= this->max_key_.x);
756 assert(key_arg.
y <= this->max_key_.y);
757 assert(key_arg.
z <= this->max_key_.z);
761 template <
typename PointT,
762 typename LeafContainerT,
763 typename BranchContainerT,
768 const double point_y_arg,
769 const double point_z_arg,
774 temp_point.x =
static_cast<float>(point_x_arg);
775 temp_point.y =
static_cast<float>(point_y_arg);
776 temp_point.z =
static_cast<float>(point_z_arg);
779 genOctreeKeyforPoint(temp_point, key_arg);
783 template <
typename PointT,
784 typename LeafContainerT,
785 typename BranchContainerT,
791 const PointT temp_point = getPointByIndex(data_arg);
794 genOctreeKeyforPoint(temp_point, key_arg);
800 template <
typename PointT,
801 typename LeafContainerT,
802 typename BranchContainerT,
809 point.x =
static_cast<float>((
static_cast<double>(key.
x) + 0.5f) * this->resolution_ +
811 point.y =
static_cast<float>((
static_cast<double>(key.
y) + 0.5f) * this->resolution_ +
813 point.z =
static_cast<float>((
static_cast<double>(key.
z) + 0.5f) * this->resolution_ +
818 template <
typename PointT,
819 typename LeafContainerT,
820 typename BranchContainerT,
829 point_arg.x =
static_cast<float>(
830 (
static_cast<double>(key_arg.
x) + 0.5f) *
832 static_cast<double>(1 << (this->octree_depth_ - tree_depth_arg))) +
834 point_arg.y =
static_cast<float>(
835 (
static_cast<double>(key_arg.
y) + 0.5f) *
837 static_cast<double>(1 << (this->octree_depth_ - tree_depth_arg))) +
839 point_arg.z =
static_cast<float>(
840 (
static_cast<double>(key_arg.
z) + 0.5f) *
842 static_cast<double>(1 << (this->octree_depth_ - tree_depth_arg))) +
847 template <
typename PointT,
848 typename LeafContainerT,
849 typename BranchContainerT,
855 Eigen::Vector3f& min_pt,
856 Eigen::Vector3f& max_pt)
const
859 double voxel_side_len =
861 static_cast<double>(1 << (this->octree_depth_ - tree_depth_arg));
864 min_pt(0) =
static_cast<float>(
static_cast<double>(key_arg.
x) * voxel_side_len +
866 min_pt(1) =
static_cast<float>(
static_cast<double>(key_arg.
y) * voxel_side_len +
868 min_pt(2) =
static_cast<float>(
static_cast<double>(key_arg.
z) * voxel_side_len +
871 max_pt(0) =
static_cast<float>(
static_cast<double>(key_arg.
x + 1) * voxel_side_len +
873 max_pt(1) =
static_cast<float>(
static_cast<double>(key_arg.
y + 1) * voxel_side_len +
875 max_pt(2) =
static_cast<float>(
static_cast<double>(key_arg.
z + 1) * voxel_side_len +
880 template <
typename PointT,
881 typename LeafContainerT,
882 typename BranchContainerT,
891 side_len = this->resolution_ *
892 static_cast<double>(1 << (this->octree_depth_ - tree_depth_arg));
895 side_len *= side_len;
901 template <
typename PointT,
902 typename LeafContainerT,
903 typename BranchContainerT,
910 return (getVoxelSquaredSideLen(tree_depth_arg) * 3);
914 template <
typename PointT,
915 typename LeafContainerT,
916 typename BranchContainerT,
927 for (
unsigned char child_idx = 0; child_idx < 8; child_idx++) {
928 if (!this->branchHasChild(*node_arg, child_idx))
932 child_node = this->getBranchChildPtr(*node_arg, child_idx);
936 new_key.
x = (key_arg.
x << 1) | (!!(child_idx & (1 << 2)));
937 new_key.
y = (key_arg.
y << 1) | (!!(child_idx & (1 << 1)));
938 new_key.
z = (key_arg.
z << 1) | (!!(child_idx & (1 << 0)));
943 voxel_count += getOccupiedVoxelCentersRecursive(
944 static_cast<const BranchNode*
>(child_node), new_key, voxel_center_list_arg);
950 genLeafNodeCenterFromOctreeKey(new_key, new_point);
951 voxel_center_list_arg.push_back(new_point);
960 return (voxel_count);
963 #define PCL_INSTANTIATE_OctreePointCloudSingleBufferWithLeafDataTVector(T) \
964 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
966 pcl::octree::OctreeContainerPointIndices, \
967 pcl::octree::OctreeContainerEmpty, \
968 pcl::octree::OctreeBase<pcl::octree::OctreeContainerPointIndices, \
969 pcl::octree::OctreeContainerEmpty>>;
970 #define PCL_INSTANTIATE_OctreePointCloudDoubleBufferWithLeafDataTVector(T) \
971 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
973 pcl::octree::OctreeContainerPointIndices, \
974 pcl::octree::OctreeContainerEmpty, \
975 pcl::octree::Octree2BufBase<pcl::octree::OctreeContainerPointIndices, \
976 pcl::octree::OctreeContainerEmpty>>;
978 #define PCL_INSTANTIATE_OctreePointCloudSingleBufferWithLeafDataT(T) \
979 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
981 pcl::octree::OctreeContainerPointIndex, \
982 pcl::octree::OctreeContainerEmpty, \
983 pcl::octree::OctreeBase<pcl::octree::OctreeContainerPointIndex, \
984 pcl::octree::OctreeContainerEmpty>>;
985 #define PCL_INSTANTIATE_OctreePointCloudDoubleBufferWithLeafDataT(T) \
986 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
988 pcl::octree::OctreeContainerPointIndex, \
989 pcl::octree::OctreeContainerEmpty, \
990 pcl::octree::Octree2BufBase<pcl::octree::OctreeContainerPointIndex, \
991 pcl::octree::OctreeContainerEmpty>>;
993 #define PCL_INSTANTIATE_OctreePointCloudSingleBufferWithEmptyLeaf(T) \
994 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
996 pcl::octree::OctreeContainerEmpty, \
997 pcl::octree::OctreeContainerEmpty, \
998 pcl::octree::OctreeBase<pcl::octree::OctreeContainerEmpty, \
999 pcl::octree::OctreeContainerEmpty>>;
1000 #define PCL_INSTANTIATE_OctreePointCloudDoubleBufferWithEmptyLeaf(T) \
1001 template class PCL_EXPORTS pcl::octree::OctreePointCloud< \
1003 pcl::octree::OctreeContainerEmpty, \
1004 pcl::octree::OctreeContainerEmpty, \
1005 pcl::octree::Octree2BufBase<pcl::octree::OctreeContainerEmpty, \
1006 pcl::octree::OctreeContainerEmpty>>;
Abstract octree branch class
static const unsigned char maxDepth
unsigned char getChildIdxWithDepthMask(uindex_t depthMask) const
get child node index using depthMask
Abstract octree node class
virtual node_type_t getNodeType() const =0
Pure virtual method for retrieving the type of octree node (branch or leaf)
double getVoxelSquaredDiameter() const
Calculates the squared diameter of a voxel at leaf depth.
void adoptBoundingBoxToPoint(const PointT &point_idx_arg)
Grow the bounding box/octree until point fits.
uindex_t getOccupiedVoxelCenters(AlignedPointTVector &voxel_center_list_arg) const
Get a PointT vector of centers of all occupied voxels.
const PointT & getPointByIndex(uindex_t index_arg) const
Get point at index from input pointcloud dataset.
void expandLeafNode(LeafNode *leaf_node, BranchNode *parent_branch, unsigned char child_idx, uindex_t depth_mask)
Add point at index from input pointcloud dataset to octree.
void deleteVoxelAtPoint(const PointT &point_arg)
Delete leaf node / voxel at given point.
void genLeafNodeCenterFromOctreeKey(const OctreeKey &key_arg, PointT &point_arg) const
Generate a point at center of leaf node voxel.
void genVoxelCenterFromOctreeKey(const OctreeKey &key_arg, uindex_t tree_depth_arg, PointT &point_arg) const
Generate a point at center of octree voxel at given tree level.
typename PointCloud::Ptr PointCloudPtr
void addPointFromCloud(uindex_t point_idx_arg, IndicesPtr indices_arg)
Add point at given index from input point cloud to octree.
OctreePointCloud(const double resolution_arg)
Octree pointcloud constructor.
shared_ptr< Indices > IndicesPtr
void addPointToCloud(const PointT &point_arg, PointCloudPtr cloud_arg)
Add point simultaneously to octree and input point cloud.
typename PointCloud::ConstPtr PointCloudConstPtr
void defineBoundingBox()
Investigate dimensions of pointcloud data set and define corresponding bounding box for octree.
void genVoxelBoundsFromOctreeKey(const OctreeKey &key_arg, uindex_t tree_depth_arg, Eigen::Vector3f &min_pt, Eigen::Vector3f &max_pt) const
Generate bounds of an octree voxel using octree key and tree depth arguments.
typename OctreeT::LeafNode LeafNode
virtual void addPointIdx(uindex_t point_idx_arg)
Add point at index from input pointcloud dataset to octree.
double getVoxelSquaredSideLen() const
Calculates the squared voxel cube side length at leaf level.
bool isVoxelOccupiedAtPoint(const PointT &point_arg) const
Check if voxel at given point exist.
std::vector< PointT, Eigen::aligned_allocator< PointT > > AlignedPointTVector
void addPointsFromInputCloud()
Add points from input point cloud to octree.
uindex_t getOccupiedVoxelCentersRecursive(const BranchNode *node_arg, const OctreeKey &key_arg, AlignedPointTVector &voxel_center_list_arg) const
Recursively search the tree for all leaf nodes and return a vector of voxel centers.
typename OctreeT::BranchNode BranchNode
void genOctreeKeyforPoint(const PointT &point_arg, OctreeKey &key_arg) const
Generate octree key for voxel at a given point.
shared_ptr< const Indices > IndicesConstPtr
void getBoundingBox(double &min_x_arg, double &min_y_arg, double &min_z_arg, double &max_x_arg, double &max_y_arg, double &max_z_arg) const
Get bounding box for octree.
uindex_t getApproxIntersectedVoxelCentersBySegment(const Eigen::Vector3f &origin, const Eigen::Vector3f &end, AlignedPointTVector &voxel_center_list, float precision=0.2)
Get a PointT vector of centers of voxels intersected by a line segment.
virtual bool genOctreeKeyForDataT(const index_t &data_arg, OctreeKey &key_arg) const
Virtual method for generating octree key for a given point index.
void getKeyBitSize()
Define octree key setting and octree depth based on defined bounding box.
Define standard C methods and C++ classes that are common to all methods.
void getMinMax3D(const pcl::PointCloud< PointT > &cloud, PointT &min_pt, PointT &max_pt)
Get the minimum and maximum values on each of the 3 (x-y-z) dimensions in a given pointcloud.
detail::int_type_t< detail::index_type_size, false > uindex_t
Type used for an unsigned index in PCL.
bool isFinite(const PointT &pt)
Tests if the 3D components of a point are all finite param[in] pt point to be tested return true if f...
detail::int_type_t< detail::index_type_size, detail::index_type_signed > index_t
Type used for an index in PCL.
IndicesAllocator<> Indices
Type used for indices in PCL.
A point structure representing Euclidean xyz coordinates, and the RGB color.
Defines basic non-point types used by PCL.