Easy3D 2.5.3
kdtree_search_nanoflann.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_NANOFLANN_H
28#define EASY3D_KD_TREE_SEARCH_NANOFLANN_H
29
30#include <easy3d/kdtree/kdtree_search.h>
31
32namespace easy3d {
33
34 class PointCloud;
35
42 public:
47 explicit KdTreeSearch_NanoFLANN(const PointCloud *cloud);
48
53 explicit KdTreeSearch_NanoFLANN(const std::vector<vec3>& points);
54
55 ~KdTreeSearch_NanoFLANN() override;
56
59
67 int find_closest_point(const vec3 &p, float &squared_distance) const override;
68
74 int find_closest_point(const vec3 &p) const override;
76
79
90 const vec3 &p, int k,
91 std::vector<int> &neighbors, std::vector<float> &squared_distances
92 ) const override;
93
101 const vec3 &p, int k,
102 std::vector<int> &neighbors
103 ) const override;
105
108
119 const vec3 &p, float squared_radius,
120 std::vector<int> &neighbors, std::vector<float> &squared_distances
121 ) const override;
122
130 const vec3 &p, float squared_radius,
131 std::vector<int> &neighbors
132 ) const override;
134
135 protected:
136 std::vector<vec3> *points_; // reference of the original point cloud data
137 void *tree_;
138 };
139
140} // namespace easy3d
141
142#endif // EASY3D_KD_TREE_SEARCH_NANOFLANN_H
143
144
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