blob: 9955d0ec3a008c546a5e1c4705e90695376df4b2 (
plain)
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
|
#include <gudhi/choose_n_farthest_points.h>
#include <CGAL/Epick_d.h>
#include <CGAL/Random.h>
#include <array>
#include <vector>
#include <iterator>
int main (void)
{
typedef CGAL::Epick_d<CGAL::Dimension_tag<4> > K;
typedef typename K::FT FT;
typedef typename K::Point_d Point_d;
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)})));
K k;
std::vector<Point_d> results;
Gudhi::subsampling::choose_n_farthest_points(k, points, 100, std::back_inserter(results));
std::cout << "Before sparsification: " << points.size() << " points.\n";
std::cout << "After sparsification: " << results.size() << " points.\n";
return 0;
}
|