Easy3D 2.5.3
kdtree_search_flann.h
1/********************************************************************
2 * Copyright (C) 2015 Liangliang Nan <liangliang.nan@gmail.com>
3 * https://3d.bk.tudelft.nl/liangliang/
4 *
5 * This file is part of Easy3D. If it is useful in your research/work,
6 * I would be grateful if you show your appreciation by citing it:
7 * ------------------------------------------------------------------
8 * Liangliang Nan.
9 * Easy3D: a lightweight, easy-to-use, and efficient C++ library
10 * for processing and rendering 3D data.
11 * Journal of Open Source Software, 6(64), 3255, 2021.
12 * ------------------------------------------------------------------
13 *
14 * Easy3D is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License Version 3
16 * as published by the Free Software Foundation.
17 *
18 * Easy3D is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
22 *
23 * You should have received a copy of the GNU General Public License
24 * along with this program. If not, see <http://www.gnu.org/licenses/>.
25 ********************************************************************/
26
27#ifndef EASY3D_KD_TREE_SEARCH_FLANN_H
28#define EASY3D_KD_TREE_SEARCH_FLANN_H
29
30#include <easy3d/kdtree/kdtree_search.h>
31
32
33namespace easy3d {
34
35 class PointCloud;
36
43 public:
48 explicit KdTreeSearch_FLANN(const PointCloud *cloud);
49
54 explicit KdTreeSearch_FLANN(const std::vector<vec3>& points);
55
56 ~KdTreeSearch_FLANN() override;
57
67 void set_checks(int chk);
68
71
79 int find_closest_point(const vec3 &p, float &squared_distance) const override;
80
86 int find_closest_point(const vec3 &p) const override;
88
91
102 const vec3 &p, int k,
103 std::vector<int> &neighbors, std::vector<float> &squared_distances
104 ) const override;
105
113 const vec3 &p, int k,
114 std::vector<int> &neighbors
115 ) const override;
117
120
131 const vec3 &p, float squared_radius,
132 std::vector<int> &neighbors, std::vector<float> &squared_distances
133 ) const override;
134
142 const vec3 &p, float squared_radius,
143 std::vector<int> &neighbors
144 ) const override;
146
147 protected:
148 int points_num_;
149 float *points_; // reference of the original point cloud data
150
151 void *tree_;
152 int checks_;
153 };
154
155} // namespace easy3d
156
157#endif // EASY3D_KD_TREE_SEARCH_FLANN_H
158
159
KdTree implementation based on FLANN.
Definition: kdtree_search_flann.h:42
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_flann.cpp:126
KdTreeSearch_FLANN(const PointCloud *cloud)
Constructor.
Definition: kdtree_search_flann.cpp:37
void set_checks(int chk)
Specifies the maximum number of leaves to visit when searching for neighbors.
Definition: kdtree_search_flann.cpp:77
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_flann.cpp:101
int find_closest_point(const vec3 &p, float &squared_distance) const override
Queries the closest point for a given point.
Definition: kdtree_search_flann.cpp:82
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