blob: 320d1f6382c256706bf39204bb665cfc7ef0deb8 (
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
|
/* 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 (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/Persistence_vectors.h>
using namespace Gudhi;
using namespace Gudhi::Persistence_representations;
#include <iostream>
int main( int argc , char** argv )
{
std::cout << "This program computes average persistence vector of persistence vectors created based on persistence diagrams provided as an input. \n";
std::cout << "Please call this program with the names of files with persistence diagrams \n";
std::vector< const char* > filenames;
if ( argc == 1 )
{
std::cout << "No input files given, the program will now terminate \n";
return 1;
}
for ( int i = 1 ; i < argc ; ++i )
{
filenames.push_back( argv[i] );
}
std::cout << "Reading persistence vectors...\n";
std::vector< Vector_distances_in_diagram< Euclidean_distance >* > lands;
for ( size_t i = 0 ; i != filenames.size() ; ++i )
{
Vector_distances_in_diagram< Euclidean_distance >* l = new Vector_distances_in_diagram< Euclidean_distance >;
l->load_from_file( filenames[i] );
lands.push_back(l );
}
Vector_distances_in_diagram< Euclidean_distance > av;
av.compute_average( lands );
av.print_to_file( "average.vect" );
for ( size_t i = 0 ; i != filenames.size() ; ++i )
{
delete lands[i];
}
std::cout << "Done \n";
return 0;
}
|
