$search
cells_ | base_local_planner::PointGrid | [private] |
footprintCost(const geometry_msgs::Point &position, const std::vector< geometry_msgs::Point > &footprint, double inscribed_radius, double circumscribed_radius) | base_local_planner::PointGrid | [virtual] |
getCellBounds(unsigned int gx, unsigned int gy, geometry_msgs::Point &lower_left, geometry_msgs::Point &upper_right) const | base_local_planner::PointGrid | [inline] |
getNearestInCell(pcl::PointXYZ &pt, unsigned int gx, unsigned int gy) | base_local_planner::PointGrid | |
getPoints(pcl::PointCloud< pcl::PointXYZ > &cloud) | base_local_planner::PointGrid | |
getPointsInRange(const geometry_msgs::Point &lower_left, const geometry_msgs::Point &upper_right, std::vector< std::list< pcl::PointXYZ > * > &points) | base_local_planner::PointGrid | |
gridCoords(geometry_msgs::Point pt, unsigned int &gx, unsigned int &gy) const | base_local_planner::PointGrid | [inline] |
gridCoords(pcl::PointXYZ pt, unsigned int &gx, unsigned int &gy) const | base_local_planner::PointGrid | [inline] |
gridIndex(unsigned int gx, unsigned int gy) const | base_local_planner::PointGrid | [inline] |
height_ | base_local_planner::PointGrid | [private] |
insert(pcl::PointXYZ pt) | base_local_planner::PointGrid | |
intersectionPoint(const geometry_msgs::Point &v1, const geometry_msgs::Point &v2, const geometry_msgs::Point &u1, const geometry_msgs::Point &u2, geometry_msgs::Point &result) | base_local_planner::PointGrid | |
max_z_ | base_local_planner::PointGrid | [private] |
nearestNeighborDistance(pcl::PointXYZ &pt) | base_local_planner::PointGrid | |
orient(const geometry_msgs::Point &a, const geometry_msgs::Point &b, const pcl::PointXYZ &c) | base_local_planner::PointGrid | [inline] |
orient(const geometry_msgs::Point32 &a, const geometry_msgs::Point32 &b, const pcl::PointXYZ &c) | base_local_planner::PointGrid | [inline] |
orient(const geometry_msgs::Point &a, const geometry_msgs::Point &b, const geometry_msgs::Point &c) | base_local_planner::PointGrid | [inline] |
orient(const pcl::PointXYZ &a, const pcl::PointXYZ &b, const pcl::PointXYZ &c) | base_local_planner::PointGrid | [inline] |
origin_ | base_local_planner::PointGrid | [private] |
PointGrid(double width, double height, double resolution, geometry_msgs::Point origin, double max_z, double obstacle_range, double min_separation) | base_local_planner::PointGrid | |
points_ | base_local_planner::PointGrid | [private] |
ptInPolygon(const pcl::PointXYZ &pt, const std::vector< geometry_msgs::Point > &poly) | base_local_planner::PointGrid | |
ptInScan(const pcl::PointXYZ &pt, const PlanarLaserScan &laser_scan) | base_local_planner::PointGrid | |
removePointsInPolygon(const std::vector< geometry_msgs::Point > poly) | base_local_planner::PointGrid | |
removePointsInScanBoundry(const PlanarLaserScan &laser_scan) | base_local_planner::PointGrid | |
resolution_ | base_local_planner::PointGrid | [private] |
segIntersect(const pcl::PointXYZ &v1, const pcl::PointXYZ &v2, const pcl::PointXYZ &u1, const pcl::PointXYZ &u2) | base_local_planner::PointGrid | [inline] |
sq_distance(pcl::PointXYZ &pt1, pcl::PointXYZ &pt2) | base_local_planner::PointGrid | [inline] |
sq_min_separation_ | base_local_planner::PointGrid | [private] |
sq_obstacle_range_ | base_local_planner::PointGrid | [private] |
updateWorld(const std::vector< geometry_msgs::Point > &footprint, const std::vector< costmap_2d::Observation > &observations, const std::vector< PlanarLaserScan > &laser_scans) | base_local_planner::PointGrid | |
width_ | base_local_planner::PointGrid | [private] |
WorldModel() | base_local_planner::WorldModel | [inline, protected] |
~PointGrid() | base_local_planner::PointGrid | [inline, virtual] |
~WorldModel() | base_local_planner::WorldModel | [inline, virtual] |