Easy3D 2.5.3
point_cloud_simplification.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_ALGO_POINT_CLOUD_SIMPLIFICATION_H
28#define EASY3D_ALGO_POINT_CLOUD_SIMPLIFICATION_H
29
30
31#include <vector>
32
33#include <easy3d/core/point_cloud.h>
34
35
36namespace easy3d {
37
38 class KdTreeSearch;
39
43 public:
44
55 static float
56 average_space(PointCloud *cloud, KdTreeSearch *kdtree = nullptr, int k = 6, bool accurate = false,
57 int samples = 10000
58 );
59
60 //----- simplification using a grid (non-uniform) ------------------------------------------------
61
70 static std::vector<PointCloud::Vertex> grid_simplification(PointCloud *cloud, float cell_size);
71
72 //----- uniform simplification (specifying distance threshold) ------------------------------------
73
84 static std::vector<PointCloud::Vertex>
85 uniform_simplification(PointCloud *cloud, float epsilon, KdTreeSearch *kdtree = nullptr);
86
87 //----- uniform simplification (specifying expected point number) ---------------------------------
88
95 static std::vector<PointCloud::Vertex> uniform_simplification(PointCloud *cloud, unsigned int num);
96 };
97
98
99} // namespace easy3d
100
101
102#endif // EASY3D_ALGO_POINT_CLOUD_SIMPLIFICATION_H
103
Base class for nearest neighbor search using KdTree.
Definition: kdtree_search.h:80
A data structure for point clouds.
Definition: point_cloud.h:45
PointCloudSimplification provides various point cloud simplification algorithms.
Definition: point_cloud_simplification.h:42
static float average_space(PointCloud *cloud, KdTreeSearch *kdtree=nullptr, int k=6, bool accurate=false, int samples=10000)
Query the average spacing of a point cloud.
Definition: point_cloud_simplification.cpp:39
static std::vector< PointCloud::Vertex > uniform_simplification(PointCloud *cloud, float epsilon, KdTreeSearch *kdtree=nullptr)
Uniformly downsample a point cloud based on a distance criterion. This function can also be used for ...
Definition: point_cloud_simplification.cpp:160
static std::vector< PointCloud::Vertex > grid_simplification(PointCloud *cloud, float cell_size)
Simplification of a point cloud using a regular grid covering the bounding box of the points....
Definition: point_cloud_simplification.cpp:132
Definition: collider.cpp:182
FT epsilon()
Function returning the epsilon value for a given type.