blob: 8b7f6a04b835e530b7a32e037e5ce96faf002d72 (
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
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
|
/* 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): Pawel Dlotko
*
* Copyright (C) 2015 INRIA Saclay (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/>.
*/
//for persistence algorithm
#include <gudhi/reader_utils.h>
#include <gudhi/Bitmap_cubical_complex.h>
#include <gudhi/Persistent_cohomology.h>
using namespace Gudhi;
using namespace Gudhi::Cubical_complex;
using namespace Gudhi::persistent_cohomology;
//standard stuff
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main( int argc , char** argv )
{
srand( time(0) );
cout << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical complexes. \
The first parameter of the program is the dimension D of the bitmap. \
The next D parameters are number of top dimensional cubes in each dimension of the bitmap.\
The program will create random cubical complex of that sizes and compute persistent homology of it." << endl;
int p = 2;
double min_persistence = 0;
if ( argc < 3 )
{
cerr << "Wrong number of parameters, the program will now terminate\n";
return 1;
}
size_t dimensionOfBitmap = (size_t)atoi( argv[1] );
std::vector< unsigned > sizes;
size_t multipliers = 1;
for ( size_t dim = 0 ; dim != dimensionOfBitmap ; ++dim )
{
unsigned sizeInThisDimension = (unsigned)atoi( argv[2+dim] );
sizes.push_back( sizeInThisDimension );
multipliers *= sizeInThisDimension;
}
std::vector< double > data;
for ( size_t i = 0 ; i != multipliers ; ++i )
{
data.push_back( rand()/(double)RAND_MAX );
}
Bitmap_cubical_complex< Bitmap_cubical_complex_base<double> > b( sizes , data );
// Compute the persistence diagram of the complex
persistent_cohomology::Persistent_cohomology< Bitmap_cubical_complex< Bitmap_cubical_complex_base<double> >, Field_Zp > pcoh(b);
pcoh.init_coefficients( p ); //initilizes the coefficient field for homology
pcoh.compute_persistent_cohomology( min_persistence );
stringstream ss;
ss << "randomComplex_persistence";
std::ofstream out(ss.str().c_str());
pcoh.output_diagram(out);
out.close();
return 0;
}
|
