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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/* 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): Siargey Kachanovich
*
* Copyright (C) 2015 INRIA Sophia Antipolis-Méditerranée (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/>.
*/
#include <gudhi/Simplex_tree.h>
#include <gudhi/Relaxed_witness_complex.h>
#include <gudhi/reader_utils.h>
#include <gudhi/Persistent_cohomology.h>
#include "Landmark_choice_random_knn.h"
#include <iostream>
#include <fstream>
#include <ctime>
#include <utility>
#include <algorithm>
#include <set>
#include <queue>
#include <iterator>
#include <boost/tuple/tuple.hpp>
#include <boost/iterator/zip_iterator.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <boost/range/iterator_range.hpp>
#include "generators.h"
#include "output.h"
using namespace Gudhi;
using namespace Gudhi::witness_complex;
using namespace Gudhi::persistent_cohomology;
typedef std::vector<Point_d> Point_Vector;
typedef Relaxed_witness_complex< Simplex_tree<> > RelaxedWitnessComplex;
int main (int argc, char * const argv[])
{
if (argc != 6) {
std::cerr << "Usage: " << argv[0]
<< " nbP nbL dim alpha limD\n";
return 0;
}
/*
boost::filesystem::path p;
for (; argc > 2; --argc, ++argv)
p /= argv[1];
*/
int nbP = atoi(argv[1]);
int nbL = atoi(argv[2]);
int dim = atoi(argv[3]);
double alpha = atof(argv[4]);
int limD = atoi(argv[5]);
//Construct the Simplex Tree
clock_t start, end;
// Construct the Simplex Tree
Simplex_tree<> simplex_tree;
// Read the point file
Point_Vector point_vector;
generate_points_sphere(point_vector, nbP, dim);
std::cout << "Successfully generated " << point_vector.size() << " points.\n";
std::cout << "Ambient dimension is " << point_vector[0].size() << ".\n";
// Choose landmarks
std::vector<std::vector< int > > knn;
std::vector<std::vector< FT > > distances;
Gudhi::witness_complex::landmark_choice_by_random_knn(point_vector, nbL, alpha, limD, knn, distances);
// Compute witness complex
start = clock();
RelaxedWitnessComplex(distances,
knn,
simplex_tree,
nbL,
alpha,
limD);
end = clock();
double time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
std::cout << "Witness complex for " << nbL << " landmarks took "
<< time << " s. \n";
// std::cout << simplex_tree << "\n";
// Compute the persistence diagram of the complex
persistent_cohomology::Persistent_cohomology< Simplex_tree<>, Field_Zp > pcoh(simplex_tree, false);
int p = 3;
pcoh.init_coefficients( p ); //initilizes the coefficient field for homology
pcoh.compute_persistent_cohomology( alpha/10 );
pcoh.output_diagram();
}
|
