|
|
| OctoMap (const LocalGridCache *cache, const ParametersMap ¶meters=ParametersMap()) |
| |
| const RtabmapColorOcTree * | octree () const |
| |
|
pcl::PointCloud< pcl::PointXYZRGB >::Ptr | createCloud (unsigned int treeDepth=0, std::vector< int > *obstacleIndices=0, std::vector< int > *emptyIndices=0, std::vector< int > *groundIndices=0, bool originalRefPoints=true, std::vector< int > *frontierIndices=0, std::vector< double > *cloudProb=0) const |
| |
|
cv::Mat | createProjectionMap (float &xMin, float &yMin, float &gridCellSize, float minGridSize=0.0f, unsigned int treeDepth=0) |
| |
|
bool | writeBinary (const std::string &path) |
| |
| virtual void | clear () |
| | Clears assembled nodes and grid bounds; does not clear LocalGridCache.
|
| |
| virtual unsigned long | getMemoryUsed () const |
| | Approximate memory used by assembled-node bookkeeping (bytes).
|
| |
| bool | hasColor () const |
| |
| bool | fullUpdateNeeded (const std::map< int, Transform > &poses) const |
| | True if the map should be rebuilt from cache (loop closure or disjoint graph).
|
| |
| bool | update (const std::map< int, Transform > &poses) |
| | Incrementally assemble new nodes from poses.
|
| |
| float | getCellSize () const |
| |
| float | getUpdateError () const |
| |
| const std::map< int, Transform > & | addedNodes () const |
| |
| void | getGridMin (double &x, double &y) const |
| | 2D grid minimum (x, y) in meters.
|
| |
| void | getGridMax (double &x, double &y) const |
| | 2D grid maximum (x, y) in meters.
|
| |
| void | getGridMin (double &x, double &y, double &z) const |
| | 3D grid minimum (x, y, z) in meters.
|
| |
| void | getGridMax (double &x, double &y, double &z) const |
| | 3D grid maximum (x, y, z) in meters.
|
| |
|
|
static std::unordered_set< octomap::OcTreeKey, octomap::OcTreeKey::KeyHash > | findEmptyNode (RtabmapColorOcTree *octree_, unsigned int treeDepth, octomap::point3d startPosition) |
| |
|
static void | floodFill (RtabmapColorOcTree *octree_, unsigned int treeDepth, octomap::point3d startPosition, std::unordered_set< octomap::OcTreeKey, octomap::OcTreeKey::KeyHash > &EmptyNodes, std::queue< octomap::point3d > &positionToExplore) |
| |
|
static bool | isNodeVisited (std::unordered_set< octomap::OcTreeKey, octomap::OcTreeKey::KeyHash > const &EmptyNodes, octomap::OcTreeKey const key) |
| |
|
static octomap::point3d | findCloseEmpty (RtabmapColorOcTree *octree_, unsigned int treeDepth, octomap::point3d startPosition) |
| |
|
static bool | isValidEmpty (RtabmapColorOcTree *octree_, unsigned int treeDepth, octomap::point3d startPosition) |
| |
| static float | logodds (double probability) |
| | Converts probability in (0, 1) to log-odds.
|
| |
| static double | probability (double logodds) |
| | Converts log-odds back to probability in (0, 1).
|
| |
Definition at line 175 of file OctoMap.h.