1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Clement Jamin
*
* Copyright (C) 2016 INRIA Sophia-Antipolis (France)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE Spatial_searching - test Spatial_tree_data_structure
#include <boost/test/unit_test.hpp>
#include <gudhi/Spatial_tree_data_structure.h>
#include <CGAL/Epick_d.h>
#include <CGAL/Random.h>
#include <array>
#include <vector>
#include <iterator>
BOOST_AUTO_TEST_CASE(test_Spatial_tree_data_structure)
{
typedef CGAL::Epick_d<CGAL::Dimension_tag<4> > K;
typedef K::FT FT;
typedef K::Point_d Point_d;
typedef std::vector<Point_d> Point_container;
typedef Gudhi::spatial_searching::Spatial_tree_data_structure<
K, Point_container> Points_ds;
typedef typename Points_ds::KNS_range KNS_range;
typedef typename Points_ds::KNS_iterator KNS_iterator;
typedef typename Points_ds::INS_range INS_range;
typedef typename Points_ds::INS_iterator INS_iterator;
CGAL::Random rd;
std::vector<Point_d> points;
for (int i = 0 ; i < 500 ; ++i)
points.push_back(Point_d(std::array<FT,4>({rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1)})));
Points_ds points_ds(points);
std::size_t closest_pt_index =
points_ds.query_ANN(points[10], 1, false).begin()->first;
BOOST_CHECK(closest_pt_index == 10);
KNS_range kns_range = points_ds.query_ANN(points[20], 10, true);
KNS_iterator nn_it = kns_range.begin();
FT last_dist = -1.;
for (auto const& nghb : kns_range)
{
BOOST_CHECK(nghb.second > last_dist);
last_dist = nghb.second;
}
}
|
