hpp-fcl
1.7.4
HPP fork of FCL -- The Flexible Collision Library
|
Go to the documentation of this file.
39 #ifndef HPP_FCL_OCTREE_H
40 #define HPP_FCL_OCTREE_H
43 #include <boost/array.hpp>
45 #include <octomap/octomap.h>
59 shared_ptr<const octomap::OcTree> tree;
68 EIGEN_MAKE_ALIGNED_OPERATOR_NEW
75 default_occupancy = tree->getOccupancyThres();
78 occupancy_threshold = tree->getOccupancyThres();
83 OcTree(
const shared_ptr<const octomap::OcTree>& tree_) : tree(tree_)
85 default_occupancy = tree->getOccupancyThres();
88 occupancy_threshold = tree->getOccupancyThres();
95 , default_occupancy(other.default_occupancy)
96 , occupancy_threshold(other.occupancy_threshold)
97 , free_threshold(other.free_threshold)
106 aabb_local = getRootBV();
107 aabb_center = aabb_local.center();
108 aabb_radius = (aabb_local.min_ - aabb_center).norm();
114 FCL_REAL delta = (1 << tree->getTreeDepth()) * tree->getResolution() / 2;
117 return AABB(
Vec3f(-delta, -delta, -delta),
Vec3f(delta, delta, delta));
123 return tree->getTreeDepth();
129 return tree->getRoot();
136 return node->getOccupancy() >= occupancy_threshold;
143 return node->getOccupancy() <= free_threshold;
149 return (!isNodeOccupied(node)) && (!isNodeFree(node));
154 std::vector<boost::array<FCL_REAL, 6> >
toBoxes()
const
156 std::vector<boost::array<FCL_REAL, 6> > boxes;
157 boxes.reserve(tree->size() / 2);
158 for(octomap::OcTree::iterator it =
159 tree->begin((
unsigned char) tree->getTreeDepth()), end = tree->end();
164 if(isNodeOccupied(&*it))
171 FCL_REAL t = tree->getOccupancyThres();
173 boost::array<FCL_REAL, 6> box = {{x, y, z, size, c, t}};
174 boxes.push_back(box);
183 return occupancy_threshold;
189 return free_threshold;
194 return default_occupancy;
199 default_occupancy = d;
204 occupancy_threshold = d;
215 #if OCTOMAP_VERSION_AT_LEAST(1,8,0)
216 return tree->getNodeChild(node, childIdx);
218 return node->getChild(childIdx);
223 const OcTreeNode*
getNodeChild(
const OcTreeNode* node,
unsigned int childIdx)
const
225 #if OCTOMAP_VERSION_AT_LEAST(1,8,0)
226 return tree->getNodeChild(node, childIdx);
228 return node->getChild(childIdx);
235 #if OCTOMAP_VERSION_AT_LEAST(1,8,0)
236 return tree->nodeChildExists(node, childIdx);
238 return node->childExists(childIdx);
245 #if OCTOMAP_VERSION_AT_LEAST(1,8,0)
246 return tree->nodeHasChildren(node);
248 return node->hasChildren();
260 static inline void computeChildBV(
const AABB& root_bv,
unsigned int i, AABB& child_bv)
264 child_bv.min_[0] = (root_bv.min_[0] + root_bv.max_[0]) * 0.5;
265 child_bv.max_[0] = root_bv.max_[0];
269 child_bv.min_[0] = root_bv.min_[0];
270 child_bv.max_[0] = (root_bv.min_[0] + root_bv.max_[0]) * 0.5;
275 child_bv.min_[1] = (root_bv.min_[1] + root_bv.max_[1]) * 0.5;
276 child_bv.max_[1] = root_bv.max_[1];
280 child_bv.min_[1] = root_bv.min_[1];
281 child_bv.max_[1] = (root_bv.min_[1] + root_bv.max_[1]) * 0.5;
286 child_bv.min_[2] = (root_bv.min_[2] + root_bv.max_[2]) * 0.5;
287 child_bv.max_[2] = root_bv.max_[2];
291 child_bv.min_[2] = root_bv.min_[2];
292 child_bv.max_[2] = (root_bv.min_[2] + root_bv.max_[2]) * 0.5;
#define HPP_FCL_DLLAPI
Definition: config.hh:64
EIGEN_MAKE_ALIGNED_OPERATOR_NEW typedef octomap::OcTreeNode OcTreeNode
Definition: octree.h:70
Eigen::Matrix< FCL_REAL, 3, 1 > Vec3f
Definition: data_types.h:67
OcTree makeOctree(const Eigen::Matrix< FCL_REAL, Eigen::Dynamic, 3 > &point_cloud, const FCL_REAL &resolution)
Build an OcTree from a point cloud and a given resolution.
bool nodeHasChildren(const OcTreeNode *node) const
return true if node has at least one child
Definition: octree.h:243
FCL_REAL getFreeThres() const
the threshold used to decide whether one node is free, this is NOT the octree free_threshold
Definition: octree.h:187
void setFreeThres(FCL_REAL d)
Definition: octree.h:207
void setCellDefaultOccupancy(FCL_REAL d)
Definition: octree.h:197
FCL_REAL getOccupancyThres() const
the threshold used to decide whether one node is occupied, this is NOT the octree occupied_thresold
Definition: octree.h:181
void computeLocalAABB()
compute the AABB for the octree in its local coordinate system
Definition: octree.h:104
The geometry for the object for collision or distance computation.
Definition: collision_object.h:65
NODE_TYPE
traversal node type: bounding volume (AABB, OBB, RSS, kIOS, OBBRSS, KDOP16, KDOP18,...
Definition: collision_object.h:58
OcTreeNode * getRoot() const
get the root node of the octree
Definition: octree.h:127
double FCL_REAL
Definition: data_types.h:66
OBJECT_TYPE
object type: BVH (mesh, points), basic geometry, octree
Definition: collision_object.h:55
AABB getRootBV() const
get the bounding volume for the root
Definition: octree.h:112
bool isNodeUncertain(const OcTreeNode *node) const
whether one node is uncertain
Definition: octree.h:147
OcTree(const shared_ptr< const octomap::OcTree > &tree_)
construct octree from octomap
Definition: octree.h:83
OcTreeNode * getNodeChild(OcTreeNode *node, unsigned int childIdx)
Definition: octree.h:213
Main namespace.
Definition: AABB.h:43
@ OT_OCTREE
Definition: collision_object.h:55
OcTree * clone() const
Clone *this into a new CollisionGeometry.
Definition: octree.h:101
A class describing the AABB collision structure, which is a box in 3D space determined by two diagona...
Definition: AABB.h:55
bool nodeChildExists(const OcTreeNode *node, unsigned int childIdx) const
return true if the child at childIdx exists
Definition: octree.h:233
@ GEOM_OCTREE
Definition: collision_object.h:59
NODE_TYPE getNodeType() const
return node type, it is an octree
Definition: octree.h:256
bool isNodeOccupied(const OcTreeNode *node) const
whether one node is completely occupied
Definition: octree.h:133
void setOccupancyThres(FCL_REAL d)
Definition: octree.h:202
std::vector< boost::array< FCL_REAL, 6 > > toBoxes() const
transform the octree into a bunch of boxes; uncertainty information is kept in the boxes....
Definition: octree.h:154
bool isNodeFree(const OcTreeNode *node) const
whether one node is completely free
Definition: octree.h:140
FCL_REAL getDefaultOccupancy() const
Definition: octree.h:192
const OcTreeNode * getNodeChild(const OcTreeNode *node, unsigned int childIdx) const
Definition: octree.h:223
OBJECT_TYPE getObjectType() const
return object type, it is an octree
Definition: octree.h:253
Octree is one type of collision geometry which can encode uncertainty information in the sensor data.
Definition: octree.h:56
OcTree(FCL_REAL resolution)
construct octree with a given resolution
Definition: octree.h:73
unsigned int getTreeDepth() const
Returns the depth of octree.
Definition: octree.h:121
OcTree(const OcTree &other)
Definition: octree.h:92