27#ifndef EASY3D_KD_TREE_SEARCH_NANOFLANN_H
28#define EASY3D_KD_TREE_SEARCH_NANOFLANN_H
30#include <easy3d/kdtree/kdtree_search.h>
91 std::vector<int> &neighbors, std::vector<float> &squared_distances
101 const vec3 &p,
int k,
102 std::vector<int> &neighbors
119 const vec3 &p,
float squared_radius,
120 std::vector<int> &neighbors, std::vector<float> &squared_distances
130 const vec3 &p,
float squared_radius,
131 std::vector<int> &neighbors
136 std::vector<vec3> *points_;
KdTree implementation based on NanoFLANN.
Definition: kdtree_search_nanoflann.h:41
KdTreeSearch_NanoFLANN(const PointCloud *cloud)
Constructor.
Definition: kdtree_search_nanoflann.cpp:72
void find_points_in_range(const vec3 &p, float squared_radius, std::vector< int > &neighbors, std::vector< float > &squared_distances) const override
Queries the nearest neighbors within a fixed range.
Definition: kdtree_search_nanoflann.cpp:143
void find_closest_k_points(const vec3 &p, int k, std::vector< int > &neighbors, std::vector< float > &squared_distances) const override
Queries the K nearest neighbors for a given point.
Definition: kdtree_search_nanoflann.cpp:118
int find_closest_point(const vec3 &p, float &squared_distance) const override
Queries the closest point for a given point.
Definition: kdtree_search_nanoflann.cpp:101
Base class for nearest neighbor search using KdTree.
Definition: kdtree_search.h:80
A data structure for point clouds.
Definition: point_cloud.h:45
Definition: collider.cpp:182