Go to the documentation of this file.
34 #ifndef OCTOMAP_OCTREE_NODE_H
35 #define OCTOMAP_OCTREE_NODE_H
Basic node in the OcTree that can hold arbitrary data of type T in value.
Definition: OcTreeDataNode.h:63
float value
stored data (payload)
Definition: OcTreeDataNode.h:128
double probability(double logodds)
compute probability from logodds:
Definition: octomap_utils.h:47
float getLogOdds() const
Definition: OcTreeNode.h:68
float getMaxChildLogOdds() const
Definition: OcTreeNode.cpp:76
~OcTreeNode()
Definition: OcTreeNode.cpp:50
Nodes to be used in OcTree.
Definition: OcTreeNode.h:55
OcTreeNode()
Definition: OcTreeNode.cpp:45
void updateOccupancyChildren()
update this node's occupancy according to its children's maximum occupancy
Definition: OcTreeNode.h:83
void addValue(const float &p)
adds p to the node's logOdds value (with no boundary / threshold checking!)
Definition: OcTreeNode.cpp:91
double getMeanChildLogOdds() const
Definition: OcTreeNode.cpp:58
void setLogOdds(float l)
sets log odds occupancy of node
Definition: OcTreeNode.h:70
double getOccupancy() const
Definition: OcTreeNode.h:65
Tables used by the Marching Cubes Algorithm The tables are from Paul Bourke's web page http://paulbou...