| all_near_neighbors(Point const &p, FT const &radius, OutputIterator it, FT eps=FT(0)) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| all_near_neighbors2(Point const &p, FT const &sq_radius_min, FT const &sq_radius_max, OutputIterator it) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| FT typedef | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | |
| incremental_furthest_neighbors(Point const &p, FT eps=FT(0)) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| incremental_nearest_neighbors(Point const &p, FT eps=FT(0)) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| INS_range typedef | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | |
| k_furthest_neighbors(Point const &p, unsigned int k, bool sorted=true, FT eps=FT(0)) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| k_nearest_neighbors(Point const &p, unsigned int k, bool sorted=true, FT eps=FT(0)) const | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| Kd_tree_search(Point_range const &points) | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| Kd_tree_search(Point_range const &points, Point_indices_range const &only_these_points) | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| Kd_tree_search(Point_range const &points, std::size_t begin_idx, std::size_t past_the_end_idx) | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | inline |
| KNS_range typedef | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | |
| Point typedef | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | |
| Traits typedef | Gudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range > | |
