Allocator_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
Ball(const Point_t ¢er=Point_t::Zero(), Format_t radius=1) | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
Distance_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
evaluate(const Point_t &p, Node_t *n) | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | virtual |
Format_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
HyperRect_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
Key_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
KeyCompare_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
List_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
m_center | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | protected |
m_dist2Fn | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | protected |
m_list | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | protected |
m_radius | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | protected |
Node_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
Point_t typedef | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
reset() | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
reset(const Point_t ¢er, Format_t radius) | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
result() | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
shouldRecurse(const HyperRect_t &r) | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | virtual |
Vector_t typedef | mpblocks::kd_tree::RangeSearchIface< Traits > | |
~Ball() | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | inlinevirtual |
~RangeSearchIface() | mpblocks::kd_tree::RangeSearchIface< Traits > | inlinevirtual |