OcTree base class, to be used with with any kind of OcTreeDataNode. More...
Inheritance diagram for octomap::OcTreeBaseImpl< NODE, INTERFACE >:
Collaboration diagram for octomap::OcTreeBaseImpl< NODE, INTERFACE >:
Public Types | |
| typedef leaf_iterator | iterator |
| typedef NODE | NodeType |
| Make the templated NODE type available from the outside. More... | |
Public Member Functions | |
| OcTreeKey | adjustKeyAtDepth (const OcTreeKey &key, unsigned int depth) const |
| Adjusts a 3D key from the lowest level to correspond to a higher depth (by shifting the key values) More... | |
| key_type | adjustKeyAtDepth (key_type key, unsigned int depth) const |
| Adjusts a single key value from the lowest level to correspond to a higher depth (by shifting the key value) More... | |
| iterator | begin (unsigned char maxDepth=0) const |
| leaf_iterator | begin_leafs (unsigned char maxDepth=0) const |
| leaf_bbx_iterator | begin_leafs_bbx (const OcTreeKey &min, const OcTreeKey &max, unsigned char maxDepth=0) const |
| leaf_bbx_iterator | begin_leafs_bbx (const point3d &min, const point3d &max, unsigned char maxDepth=0) const |
| tree_iterator | begin_tree (unsigned char maxDepth=0) const |
| size_t | calcNumNodes () const |
| Traverses the tree to calculate the total number of nodes. More... | |
| void | clear () |
| Deletes the complete tree structure. More... | |
| void | clearKeyRays () |
| Clear KeyRay vector to minimize unneeded memory. More... | |
| bool | computeRay (const point3d &origin, const point3d &end, std::vector< point3d > &ray) |
| Traces a ray from origin to end (excluding), returning the coordinates of all nodes traversed by the beam. More... | |
| bool | computeRayKeys (const point3d &origin, const point3d &end, KeyRay &ray) const |
| Traces a ray from origin to end (excluding), returning an OcTreeKey of all nodes traversed by the beam. More... | |
| OcTreeKey | coordToKey (const point3d &coord) const |
| Converts from a 3D coordinate into a 3D addressing key. More... | |
| OcTreeKey | coordToKey (const point3d &coord, unsigned depth) const |
| Converts from a 3D coordinate into a 3D addressing key at a given depth. More... | |
| key_type | coordToKey (double coordinate) const |
| Converts from a single coordinate into a discrete key. More... | |
| key_type | coordToKey (double coordinate, unsigned depth) const |
| Converts from a single coordinate into a discrete key at a given depth. More... | |
| OcTreeKey | coordToKey (double x, double y, double z) const |
| Converts from a 3D coordinate into a 3D addressing key. More... | |
| OcTreeKey | coordToKey (double x, double y, double z, unsigned depth) const |
| Converts from a 3D coordinate into a 3D addressing key at a given depth. More... | |
| bool | coordToKeyChecked (const point3d &coord, OcTreeKey &key) const |
| Converts a 3D coordinate into a 3D OcTreeKey, with boundary checking. More... | |
| bool | coordToKeyChecked (const point3d &coord, unsigned depth, OcTreeKey &key) const |
| Converts a 3D coordinate into a 3D OcTreeKey at a certain depth, with boundary checking. More... | |
| bool | coordToKeyChecked (double coordinate, key_type &key) const |
| Converts a single coordinate into a discrete addressing key, with boundary checking. More... | |
| bool | coordToKeyChecked (double coordinate, unsigned depth, key_type &key) const |
| Converts a single coordinate into a discrete addressing key, with boundary checking. More... | |
| bool | coordToKeyChecked (double x, double y, double z, OcTreeKey &key) const |
| Converts a 3D coordinate into a 3D OcTreeKey, with boundary checking. More... | |
| bool | coordToKeyChecked (double x, double y, double z, unsigned depth, OcTreeKey &key) const |
| Converts a 3D coordinate into a 3D OcTreeKey at a certain depth, with boundary checking. More... | |
| NODE * | createNodeChild (NODE *node, unsigned int childIdx) |
| Creates (allocates) the i-th child of the node. More... | |
| bool | deleteNode (const OcTreeKey &key, unsigned int depth=0) |
| Delete a node (if exists) given an addressing key. More... | |
| bool | deleteNode (const point3d &value, unsigned int depth=0) |
| Delete a node (if exists) given a 3d point. More... | |
| bool | deleteNode (double x, double y, double z, unsigned int depth=0) |
| Delete a node (if exists) given a 3d point. More... | |
| void | deleteNodeChild (NODE *node, unsigned int childIdx) |
| Deletes the i-th child of the node. More... | |
| const iterator | end () const |
| const leaf_iterator | end_leafs () const |
| const leaf_bbx_iterator | end_leafs_bbx () const |
| const tree_iterator | end_tree () const |
| virtual void | expand () |
| Expands all pruned nodes (reverse of prune()) More... | |
| virtual void | expandNode (NODE *node) |
| Expands a node (reverse of pruning): All children are created and their occupancy probability is set to the node's value. More... | |
| virtual void | getMetricMax (double &x, double &y, double &z) |
| maximum value of the bounding box of all known space in x, y, z More... | |
| void | getMetricMax (double &x, double &y, double &z) const |
| maximum value of the bounding box of all known space in x, y, z More... | |
| virtual void | getMetricMin (double &x, double &y, double &z) |
| minimum value of the bounding box of all known space in x, y, z More... | |
| void | getMetricMin (double &x, double &y, double &z) const |
| minimum value of the bounding box of all known space in x, y, z More... | |
| virtual void | getMetricSize (double &x, double &y, double &z) |
| Size of OcTree (all known space) in meters for x, y and z dimension. More... | |
| virtual void | getMetricSize (double &x, double &y, double &z) const |
| Size of OcTree (all known space) in meters for x, y and z dimension. More... | |
| const NODE * | getNodeChild (const NODE *node, unsigned int childIdx) const |
| NODE * | getNodeChild (NODE *node, unsigned int childIdx) const |
| double | getNodeSize (unsigned depth) const |
| size_t | getNumLeafNodes () const |
| Traverses the tree to calculate the total number of leaf nodes. More... | |
| double | getResolution () const |
| NODE * | getRoot () const |
| unsigned int | getTreeDepth () const |
| std::string | getTreeType () const |
| void | getUnknownLeafCenters (point3d_list &node_centers, point3d pmin, point3d pmax, unsigned int depth=0) const |
| return centers of leafs that do NOT exist (but could) in a given bounding box More... | |
| virtual bool | isNodeCollapsible (const NODE *node) const |
| A node is collapsible if all children exist, don't have children of their own and have the same occupancy value. More... | |
| point3d | keyToCoord (const OcTreeKey &key) const |
| converts from an addressing key at the lowest tree level into a coordinate corresponding to the key's center More... | |
| point3d | keyToCoord (const OcTreeKey &key, unsigned depth) const |
| converts from an addressing key at a given depth into a coordinate corresponding to the key's center More... | |
| double | keyToCoord (key_type key) const |
| converts from a discrete key at the lowest tree level into a coordinate corresponding to the key's center More... | |
| double | keyToCoord (key_type key, unsigned depth) const |
| converts from a discrete key at a given depth into a coordinate corresponding to the key's center More... | |
| unsigned long long | memoryFullGrid () const |
| virtual size_t | memoryUsage () const |
| virtual size_t | memoryUsageNode () const |
| bool | nodeChildExists (const NODE *node, unsigned int childIdx) const |
| Safe test if node has a child at index childIdx. More... | |
| bool | nodeHasChildren (const NODE *node) const |
| Safe test if node has any children. More... | |
| OcTreeBaseImpl (const OcTreeBaseImpl< NODE, INTERFACE > &rhs) | |
| Deep copy constructor. More... | |
| OcTreeBaseImpl (double resolution) | |
| bool | operator== (const OcTreeBaseImpl< NODE, INTERFACE > &rhs) const |
| Comparison between two octrees, all meta data, all nodes, and the structure must be identical. More... | |
| virtual void | prune () |
| Lossless compression of the octree: A node will replace all of its eight children if they have identical values. More... | |
| virtual bool | pruneNode (NODE *node) |
| Prunes a node when it is collapsible. More... | |
| std::istream & | readData (std::istream &s) |
| Read all nodes from the input stream (without file header), for this the tree needs to be already created. More... | |
| NODE * | search (const OcTreeKey &key, unsigned int depth=0) const |
| Search a node at specified depth given an addressing key (depth=0: search full tree depth) You need to check if the returned node is NULL, since it can be in unknown space. More... | |
| NODE * | search (const point3d &value, unsigned int depth=0) const |
| Search node at specified depth given a 3d point (depth=0: search full tree depth) You need to check if the returned node is NULL, since it can be in unknown space. More... | |
| NODE * | search (double x, double y, double z, unsigned int depth=0) const |
| Search node at specified depth given a 3d point (depth=0: search full tree depth). More... | |
| void | setResolution (double r) |
| Change the resolution of the octree, scaling all voxels. This will not preserve the (metric) scale! More... | |
| virtual size_t | size () const |
| void | swapContent (OcTreeBaseImpl< NODE, INTERFACE > &rhs) |
| Swap contents of two octrees, i.e., only the underlying pointer / tree structure. More... | |
| double | volume () |
| std::ostream & | writeData (std::ostream &s) const |
| Write complete state of tree to stream (without file header) unmodified. Pruning the tree first produces smaller files (lossless compression) More... | |
| virtual | ~OcTreeBaseImpl () |
Protected Member Functions | |
| void | allocNodeChildren (NODE *node) |
| void | calcMinMax () |
| recalculates min and max in x, y, z. Does nothing when tree size didn't change. More... | |
| void | calcNumNodesRecurs (NODE *node, size_t &num_nodes) const |
| void | deleteNodeRecurs (NODE *node) |
| Recursively delete a node and all children. Deallocates memory but does NOT set the node ptr to NULL nor updates tree size. More... | |
| bool | deleteNodeRecurs (NODE *node, unsigned int depth, unsigned int max_depth, const OcTreeKey &key) |
| recursive call of deleteNode() More... | |
| void | expandRecurs (NODE *node, unsigned int depth, unsigned int max_depth) |
| recursive call of expand() More... | |
| size_t | getNumLeafNodesRecurs (const NODE *parent) const |
| void | init () |
| initialize non-trivial members, helper for constructors More... | |
| OcTreeBaseImpl (double resolution, unsigned int tree_depth, unsigned int tree_max_val) | |
| Constructor to enable derived classes to change tree constants. This usually requires a re-implementation of some core tree-traversal functions as well! More... | |
| void | pruneRecurs (NODE *node, unsigned int depth, unsigned int max_depth, unsigned int &num_pruned) |
| recursive call of prune() More... | |
| std::istream & | readNodesRecurs (NODE *, std::istream &s) |
| recursive call of readData() More... | |
| std::ostream & | writeNodesRecurs (const NODE *, std::ostream &s) const |
| recursive call of writeData() More... | |
Protected Attributes | |
| std::vector< KeyRay > | keyrays |
| data structure for ray casting, array for multithreading More... | |
| const leaf_bbx_iterator | leaf_iterator_bbx_end |
| const leaf_iterator | leaf_iterator_end |
| double | max_value [3] |
| max in x, y, z More... | |
| double | min_value [3] |
| min in x, y, z contains the size of a voxel at level i (0: root node). tree_depth+1 levels (incl. 0) More... | |
| double | resolution |
| in meters More... | |
| double | resolution_factor |
| = 1. / resolution More... | |
| NODE * | root |
| Pointer to the root NODE, NULL for empty tree. More... | |
| bool | size_changed |
| std::vector< double > | sizeLookupTable |
| point3d | tree_center |
| const unsigned int | tree_depth |
| Maximum tree depth is fixed to 16 currently. More... | |
| const tree_iterator | tree_iterator_end |
| const unsigned int | tree_max_val |
| size_t | tree_size |
| number of nodes in tree flag to denote whether the octree extent changed (for lazy min/max eval) More... | |
Detailed Description
template<class NODE, class INTERFACE>
class octomap::OcTreeBaseImpl< NODE, INTERFACE >
OcTree base class, to be used with with any kind of OcTreeDataNode.
This tree implementation currently has a maximum depth of 16 nodes. For this reason, coordinates values have to be, e.g., below +/- 327.68 meters (2^15) at a maximum resolution of 0.01m.
This limitation enables the use of an efficient key generation method which uses the binary representation of the data point coordinates.
- Note
- You should probably not use this class directly, but OcTreeBase or OccupancyOcTreeBase instead
- Template Parameters
-
NODE Node class to be used in tree (usually derived from OcTreeDataNode) INTERFACE Interface to be derived from, should be either AbstractOcTree or AbstractOccupancyOcTree
Member Typedef Documentation
◆ iterator
| typedef leaf_iterator octomap::OcTreeBaseImpl< NODE, INTERFACE >::iterator |
◆ NodeType
| typedef NODE octomap::OcTreeBaseImpl< NODE, INTERFACE >::NodeType |
Make the templated NODE type available from the outside.
Constructor & Destructor Documentation
◆ OcTreeBaseImpl() [1/3]
| octomap::OcTreeBaseImpl< NODE, I >::OcTreeBaseImpl | ( | double | resolution | ) |
◆ ~OcTreeBaseImpl()
|
virtual |
◆ OcTreeBaseImpl() [2/3]
| octomap::OcTreeBaseImpl< NODE, INTERFACE >::OcTreeBaseImpl | ( | const OcTreeBaseImpl< NODE, INTERFACE > & | rhs | ) |
Deep copy constructor.
◆ OcTreeBaseImpl() [3/3]
|
protected |
Constructor to enable derived classes to change tree constants. This usually requires a re-implementation of some core tree-traversal functions as well!
Member Function Documentation
◆ adjustKeyAtDepth() [1/2]
|
inline |
Adjusts a 3D key from the lowest level to correspond to a higher depth (by shifting the key values)
- Parameters
-
key Input key, at the lowest tree level depth Target depth level for the new key
- Returns
- Key for the new depth level
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::adjustKeyAtDepth().
◆ adjustKeyAtDepth() [2/2]
| key_type octomap::OcTreeBaseImpl< NODE, I >::adjustKeyAtDepth | ( | key_type | key, |
| unsigned int | depth | ||
| ) | const |
Adjusts a single key value from the lowest level to correspond to a higher depth (by shifting the key value)
- Parameters
-
key Input key, at the lowest tree level depth Target depth level for the new key
- Returns
- Key for the new depth level
◆ allocNodeChildren()
|
protected |
◆ begin()
|
inline |
- Returns
- beginning of the tree as leaf iterator
Referenced by boundingBoxTest(), and main().
◆ begin_leafs()
|
inline |
- Returns
- beginning of the tree as leaf iterator
Referenced by boundingBoxTest(), and main().
◆ begin_leafs_bbx() [1/2]
|
inline |
- Returns
- beginning of the tree as leaf iterator in a bounding box
Referenced by boundingBoxTest(), and main().
◆ begin_leafs_bbx() [2/2]
|
inline |
- Returns
- beginning of the tree as leaf iterator in a bounding box
◆ begin_tree()
|
inline |
- Returns
- beginning of the tree as iterator to all nodes (incl. inner)
Referenced by calcThresholdedNodes(), main(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::operator==(), and printChanges().
◆ calcMinMax()
|
protected |
recalculates min and max in x, y, z. Does nothing when tree size didn't change.
◆ calcNumNodes()
| size_t octomap::OcTreeBaseImpl< NODE, I >::calcNumNodes |
Traverses the tree to calculate the total number of nodes.
Referenced by main().
◆ calcNumNodesRecurs()
|
protected |
◆ clear()
| void octomap::OcTreeBaseImpl< NODE, I >::clear |
Deletes the complete tree structure.
Referenced by main().
◆ clearKeyRays()
|
inline |
Clear KeyRay vector to minimize unneeded memory.
This is only useful for the StaticMemberInitializer classes, don't call it for an octree that is actually used.
Referenced by octomap::OcTree::StaticMemberInitializer::StaticMemberInitializer(), octomap::CountingOcTree::StaticMemberInitializer::StaticMemberInitializer(), octomap::OcTreeStamped::StaticMemberInitializer::StaticMemberInitializer(), and octomap::ColorOcTree::StaticMemberInitializer::StaticMemberInitializer().
◆ computeRay()
| bool octomap::OcTreeBaseImpl< NODE, I >::computeRay | ( | const point3d & | origin, |
| const point3d & | end, | ||
| std::vector< point3d > & | ray | ||
| ) |
Traces a ray from origin to end (excluding), returning the coordinates of all nodes traversed by the beam.
You still need to check if a node at that coordinate exists (e.g. with search()).
- Note
- : use the faster computeRayKeys method if possible.
- Parameters
-
origin start coordinate of ray end end coordinate of ray ray KeyRay structure that holds the keys of all nodes traversed by the ray, excluding "end"
- Returns
- Success of operation. Returning false usually means that one of the coordinates is out of the OcTree's range
◆ computeRayKeys()
| bool octomap::OcTreeBaseImpl< NODE, I >::computeRayKeys | ( | const point3d & | origin, |
| const point3d & | end, | ||
| KeyRay & | ray | ||
| ) | const |
Traces a ray from origin to end (excluding), returning an OcTreeKey of all nodes traversed by the beam.
You still need to check if a node at that coordinate exists (e.g. with search()).
- Parameters
-
origin start coordinate of ray end end coordinate of ray ray KeyRay structure that holds the keys of all nodes traversed by the ray, excluding "end"
- Returns
- Success of operation. Returning false usually means that one of the coordinates is out of the OcTree's range
◆ coordToKey() [1/6]
|
inline |
Converts from a 3D coordinate into a 3D addressing key.
◆ coordToKey() [2/6]
|
inline |
Converts from a 3D coordinate into a 3D addressing key at a given depth.
◆ coordToKey() [3/6]
|
inline |
Converts from a single coordinate into a discrete key.
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::coordToKey().
◆ coordToKey() [4/6]
|
inline |
Converts from a single coordinate into a discrete key at a given depth.
◆ coordToKey() [5/6]
|
inline |
Converts from a 3D coordinate into a 3D addressing key.
◆ coordToKey() [6/6]
|
inline |
Converts from a 3D coordinate into a 3D addressing key at a given depth.
◆ coordToKeyChecked() [1/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | const point3d & | coord, |
| OcTreeKey & | key | ||
| ) | const |
Converts a 3D coordinate into a 3D OcTreeKey, with boundary checking.
- Parameters
-
coord 3d coordinate of a point key values that will be computed, an array of fixed size 3.
- Returns
- true if point is within the octree (valid), false otherwise
Referenced by boundingBoxTest(), and main().
◆ coordToKeyChecked() [2/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | const point3d & | coord, |
| unsigned | depth, | ||
| OcTreeKey & | key | ||
| ) | const |
Converts a 3D coordinate into a 3D OcTreeKey at a certain depth, with boundary checking.
- Parameters
-
coord 3d coordinate of a point depth level of the key from the top key values that will be computed, an array of fixed size 3.
- Returns
- true if point is within the octree (valid), false otherwise
◆ coordToKeyChecked() [3/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | double | coordinate, |
| key_type & | key | ||
| ) | const |
Converts a single coordinate into a discrete addressing key, with boundary checking.
- Parameters
-
coordinate 3d coordinate of a point key discrete 16 bit adressing key, result
- Returns
- true if coordinate is within the octree bounds (valid), false otherwise
◆ coordToKeyChecked() [4/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | double | coordinate, |
| unsigned | depth, | ||
| key_type & | key | ||
| ) | const |
Converts a single coordinate into a discrete addressing key, with boundary checking.
- Parameters
-
coordinate 3d coordinate of a point depth level of the key from the top key discrete 16 bit adressing key, result
- Returns
- true if coordinate is within the octree bounds (valid), false otherwise
◆ coordToKeyChecked() [5/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | double | x, |
| double | y, | ||
| double | z, | ||
| OcTreeKey & | key | ||
| ) | const |
Converts a 3D coordinate into a 3D OcTreeKey, with boundary checking.
- Parameters
-
x y z key values that will be computed, an array of fixed size 3.
- Returns
- true if point is within the octree (valid), false otherwise
◆ coordToKeyChecked() [6/6]
| bool octomap::OcTreeBaseImpl< NODE, I >::coordToKeyChecked | ( | double | x, |
| double | y, | ||
| double | z, | ||
| unsigned | depth, | ||
| OcTreeKey & | key | ||
| ) | const |
Converts a 3D coordinate into a 3D OcTreeKey at a certain depth, with boundary checking.
- Parameters
-
x y z depth level of the key from the top key values that will be computed, an array of fixed size 3.
- Returns
- true if point is within the octree (valid), false otherwise
◆ createNodeChild()
| NODE * octomap::OcTreeBaseImpl< NODE, I >::createNodeChild | ( | NODE * | node, |
| unsigned int | childIdx | ||
| ) |
Creates (allocates) the i-th child of the node.
- Returns
- ptr to newly create NODE
Referenced by main().
◆ deleteNode() [1/3]
| bool octomap::OcTreeBaseImpl< NODE, I >::deleteNode | ( | const OcTreeKey & | key, |
| unsigned int | depth = 0 |
||
| ) |
Delete a node (if exists) given an addressing key.
Will always delete at the lowest level unless depth !=0, and expand pruned inner nodes as needed. Pruned nodes at level "depth" will directly be deleted as a whole.
◆ deleteNode() [2/3]
| bool octomap::OcTreeBaseImpl< NODE, I >::deleteNode | ( | const point3d & | value, |
| unsigned int | depth = 0 |
||
| ) |
Delete a node (if exists) given a 3d point.
Will always delete at the lowest level unless depth !=0, and expand pruned inner nodes as needed. Pruned nodes at level "depth" will directly be deleted as a whole.
◆ deleteNode() [3/3]
| bool octomap::OcTreeBaseImpl< NODE, I >::deleteNode | ( | double | x, |
| double | y, | ||
| double | z, | ||
| unsigned int | depth = 0 |
||
| ) |
Delete a node (if exists) given a 3d point.
Will always delete at the lowest level unless depth !=0, and expand pruned inner nodes as needed. Pruned nodes at level "depth" will directly be deleted as a whole.
◆ deleteNodeChild()
| void octomap::OcTreeBaseImpl< NODE, I >::deleteNodeChild | ( | NODE * | node, |
| unsigned int | childIdx | ||
| ) |
Deletes the i-th child of the node.
Referenced by main().
◆ deleteNodeRecurs() [1/2]
|
protected |
Recursively delete a node and all children. Deallocates memory but does NOT set the node ptr to NULL nor updates tree size.
◆ deleteNodeRecurs() [2/2]
|
protected |
recursive call of deleteNode()
◆ end()
|
inline |
- Returns
- end of the tree as leaf iterator
Referenced by boundingBoxTest(), and main().
◆ end_leafs()
|
inline |
- Returns
- end of the tree as leaf iterator
Referenced by boundingBoxTest(), and main().
◆ end_leafs_bbx()
|
inline |
- Returns
- end of the tree as leaf iterator in a bounding box
Referenced by boundingBoxTest(), and main().
◆ end_tree()
|
inline |
- Returns
- end of the tree as iterator to all nodes (incl. inner)
Referenced by calcThresholdedNodes(), main(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::operator==(), and printChanges().
◆ expand()
|
virtual |
Expands all pruned nodes (reverse of prune())
- Note
- This is an expensive operation, especially when the tree is nearly empty!
Referenced by boundingBoxTest(), main(), and printChanges().
◆ expandNode()
|
virtual |
Expands a node (reverse of pruning): All children are created and their occupancy probability is set to the node's value.
You need to verify that this is indeed a pruned node (i.e. not a leaf at the lowest level)
Referenced by main().
◆ expandRecurs()
|
protected |
recursive call of expand()
◆ getMetricMax() [1/2]
|
virtual |
maximum value of the bounding box of all known space in x, y, z
Referenced by boundingBoxTest().
◆ getMetricMax() [2/2]
| void octomap::OcTreeBaseImpl< NODE, I >::getMetricMax | ( | double & | x, |
| double & | y, | ||
| double & | z | ||
| ) | const |
maximum value of the bounding box of all known space in x, y, z
◆ getMetricMin() [1/2]
|
virtual |
minimum value of the bounding box of all known space in x, y, z
Referenced by boundingBoxTest().
◆ getMetricMin() [2/2]
| void octomap::OcTreeBaseImpl< NODE, I >::getMetricMin | ( | double & | x, |
| double & | y, | ||
| double & | z | ||
| ) | const |
minimum value of the bounding box of all known space in x, y, z
◆ getMetricSize() [1/2]
|
virtual |
Size of OcTree (all known space) in meters for x, y and z dimension.
Referenced by main(), and outputStatistics().
◆ getMetricSize() [2/2]
|
virtual |
Size of OcTree (all known space) in meters for x, y and z dimension.
◆ getNodeChild() [1/2]
| const NODE * octomap::OcTreeBaseImpl< NODE, I >::getNodeChild | ( | const NODE * | node, |
| unsigned int | childIdx | ||
| ) | const |
- Returns
- const ptr to child number childIdx of node
◆ getNodeChild() [2/2]
| NODE * octomap::OcTreeBaseImpl< NODE, I >::getNodeChild | ( | NODE * | node, |
| unsigned int | childIdx | ||
| ) | const |
- Returns
- ptr to child number childIdx of node
Referenced by getLeafNodesRecurs(), and getVoxelsRecurs().
◆ getNodeSize()
|
inline |
◆ getNumLeafNodes()
| size_t octomap::OcTreeBaseImpl< NODE, I >::getNumLeafNodes |
Traverses the tree to calculate the total number of leaf nodes.
Referenced by main(), and outputStatistics().
◆ getNumLeafNodesRecurs()
|
protected |
◆ getResolution()
|
inline |
Referenced by getLeafNodesRecurs(), getVoxelsRecurs(), and main().
◆ getRoot()
|
inline |
◆ getTreeDepth()
|
inline |
Referenced by main().
◆ getTreeType()
|
inline |
◆ getUnknownLeafCenters()
| void octomap::OcTreeBaseImpl< NODE, I >::getUnknownLeafCenters | ( | point3d_list & | node_centers, |
| point3d | pmin, | ||
| point3d | pmax, | ||
| unsigned int | depth = 0 |
||
| ) | const |
return centers of leafs that do NOT exist (but could) in a given bounding box
◆ init()
|
protected |
initialize non-trivial members, helper for constructors
◆ isNodeCollapsible()
|
virtual |
A node is collapsible if all children exist, don't have children of their own and have the same occupancy value.
Reimplemented in octomap::ColorOcTree.
◆ keyToCoord() [1/4]
|
inline |
converts from an addressing key at the lowest tree level into a coordinate corresponding to the key's center
◆ keyToCoord() [2/4]
|
inline |
converts from an addressing key at a given depth into a coordinate corresponding to the key's center
◆ keyToCoord() [3/4]
|
inline |
converts from a discrete key at the lowest tree level into a coordinate corresponding to the key's center
◆ keyToCoord() [4/4]
| double octomap::OcTreeBaseImpl< NODE, I >::keyToCoord | ( | key_type | key, |
| unsigned | depth | ||
| ) | const |
converts from a discrete key at a given depth into a coordinate corresponding to the key's center
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::keyToCoord(), and main().
◆ memoryFullGrid()
| unsigned long long octomap::OcTreeBaseImpl< NODE, I >::memoryFullGrid |
- Returns
- Memory usage of a full grid of the same size as the OcTree in bytes (for comparison)
- Note
- this can be larger than the adressable memory - size_t may not be enough to hold it!
Referenced by main(), and outputStatistics().
◆ memoryUsage()
|
virtual |
- Returns
- Memory usage of the complete octree in bytes (may vary between architectures)
Referenced by main(), and outputStatistics().
◆ memoryUsageNode()
|
inlinevirtual |
- Returns
- Memory usage of a single octree node
◆ nodeChildExists()
| bool octomap::OcTreeBaseImpl< NODE, I >::nodeChildExists | ( | const NODE * | node, |
| unsigned int | childIdx | ||
| ) | const |
Safe test if node has a child at index childIdx.
First tests if there are any children. Replaces node->childExists(...)
- Returns
- true if the child at childIdx exists
Referenced by getLeafNodesRecurs(), getVoxelsRecurs(), and main().
◆ nodeHasChildren()
| bool octomap::OcTreeBaseImpl< NODE, I >::nodeHasChildren | ( | const NODE * | node | ) | const |
Safe test if node has any children.
Replaces node->hasChildren(...)
- Returns
- true if node has at least one child
Referenced by boundingBoxTest(), getLeafNodesRecurs(), getVoxelsRecurs(), and main().
◆ operator==()
| bool octomap::OcTreeBaseImpl< NODE, I >::operator== | ( | const OcTreeBaseImpl< NODE, INTERFACE > & | rhs | ) | const |
Comparison between two octrees, all meta data, all nodes, and the structure must be identical.
◆ prune()
|
virtual |
Lossless compression of the octree: A node will replace all of its eight children if they have identical values.
You usually don't have to call prune() after a regular occupancy update, updateNode() incrementally prunes all affected nodes.
Referenced by main(), and printChanges().
◆ pruneNode()
|
virtual |
Prunes a node when it is collapsible.
- Returns
- true if pruning was successful
Reimplemented in octomap::ColorOcTree.
Referenced by main().
◆ pruneRecurs()
|
protected |
recursive call of prune()
◆ readData()
| std::istream & octomap::OcTreeBaseImpl< NODE, I >::readData | ( | std::istream & | s | ) |
Read all nodes from the input stream (without file header), for this the tree needs to be already created.
For general file IO, you should probably use AbstractOcTree::read() instead.
Referenced by main(), and octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::readNodesRecurs().
◆ readNodesRecurs()
|
protected |
recursive call of readData()
◆ search() [1/3]
| NODE * octomap::OcTreeBaseImpl< NODE, I >::search | ( | const OcTreeKey & | key, |
| unsigned int | depth = 0 |
||
| ) | const |
Search a node at specified depth given an addressing key (depth=0: search full tree depth) You need to check if the returned node is NULL, since it can be in unknown space.
- Returns
- pointer to node if found, NULL otherwise
◆ search() [2/3]
| NODE * octomap::OcTreeBaseImpl< NODE, I >::search | ( | const point3d & | value, |
| unsigned int | depth = 0 |
||
| ) | const |
Search node at specified depth given a 3d point (depth=0: search full tree depth) You need to check if the returned node is NULL, since it can be in unknown space.
- Returns
- pointer to node if found, NULL otherwise
◆ search() [3/3]
| NODE * octomap::OcTreeBaseImpl< NODE, I >::search | ( | double | x, |
| double | y, | ||
| double | z, | ||
| unsigned int | depth = 0 |
||
| ) | const |
Search node at specified depth given a 3d point (depth=0: search full tree depth).
You need to check if the returned node is NULL, since it can be in unknown space.
- Returns
- pointer to node if found, NULL otherwise
Referenced by boundingBoxTest(), main(), and printChanges().
◆ setResolution()
| void octomap::OcTreeBaseImpl< NODE, I >::setResolution | ( | double | r | ) |
Change the resolution of the octree, scaling all voxels. This will not preserve the (metric) scale!
Referenced by main().
◆ size()
|
inlinevirtual |
- Returns
- The number of nodes in the tree
Referenced by main(), and outputStatistics().
◆ swapContent()
| void octomap::OcTreeBaseImpl< NODE, I >::swapContent | ( | OcTreeBaseImpl< NODE, INTERFACE > & | rhs | ) |
Swap contents of two octrees, i.e., only the underlying pointer / tree structure.
You have to ensure yourself that the metadata (resolution etc) matches. No memory is cleared in this function
Referenced by main().
◆ volume()
| double octomap::OcTreeBaseImpl< NODE, I >::volume |
◆ writeData()
| std::ostream & octomap::OcTreeBaseImpl< NODE, I >::writeData | ( | std::ostream & | s | ) | const |
Write complete state of tree to stream (without file header) unmodified. Pruning the tree first produces smaller files (lossless compression)
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::writeNodesRecurs().
◆ writeNodesRecurs()
|
protected |
recursive call of writeData()
Field Documentation
◆ keyrays
|
protected |
data structure for ray casting, array for multithreading
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::clearKeyRays().
◆ leaf_iterator_bbx_end
|
protected |
◆ leaf_iterator_end
|
protected |
◆ max_value
|
protected |
max in x, y, z
◆ min_value
|
protected |
min in x, y, z contains the size of a voxel at level i (0: root node). tree_depth+1 levels (incl. 0)
◆ resolution
|
protected |
◆ resolution_factor
|
protected |
= 1. / resolution
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::coordToKey().
◆ root
|
protected |
Pointer to the root NODE, NULL for empty tree.
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::getRoot(), and octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::swapContent().
◆ size_changed
|
protected |
◆ sizeLookupTable
|
protected |
◆ tree_center
|
protected |
◆ tree_depth
|
protected |
Maximum tree depth is fixed to 16 currently.
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::adjustKeyAtDepth(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::coordToKey(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::getNodeSize(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::getTreeDepth(), and octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::operator==().
◆ tree_iterator_end
|
protected |
◆ tree_max_val
|
protected |
◆ tree_size
|
protected |
number of nodes in tree flag to denote whether the octree extent changed (for lazy min/max eval)
Referenced by octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::operator==(), octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::size(), and octomap::OcTreeBaseImpl< ColorOcTreeNode, AbstractOccupancyOcTree >::swapContent().
The documentation for this class was generated from the following files:
- include/octomap/OcTreeBaseImpl.h
- include/octomap/OcTreeBaseImpl.hxx
