blob: 3065b52c2a5dbec382fd57894b338d43e300b73d (
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
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): 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_landscape_on_grid.h>
using namespace Gudhi;
using namespace Gudhi::Persistence_representations;
#include <iostream>
#include <sstream>
int main( int argc , char** argv )
{
std::cout << "This program compute distance of persistence landscapes on grid stored in a file (the file needs to be created beforehand). \n";
std::cout << "The first parameter of a program is an integer p. The program compute L^p distance of the landscapes on grid. For L^infty distance choose p = -1. \n";
std::cout << "The remaining parameters of this programs are names of files with persistence landscapes on grid.\n";
if ( argc < 3 )
{
std::cout << "Wrong number of parameters, the program will now terminate \n";
return 1;
}
int pp = atoi( argv[1] );
double p = std::numeric_limits<double>::max();
if ( pp != -1 )
{
p = pp;
}
std::vector< const char* > filenames;
for ( int i = 2 ; i < argc ; ++i )
{
filenames.push_back( argv[i] );
}
std::vector< Persistence_landscape_on_grid > landscaspes;
landscaspes.reserve( filenames.size() );
for ( size_t file_no = 0 ; file_no != filenames.size() ; ++file_no )
{
Persistence_landscape_on_grid l;
l.load_landscape_from_file( filenames[file_no] );
landscaspes.push_back( l );
}
//and now we will compute the scalar product of landscapes.
//first we prepare an array:
std::vector< std::vector< double > > distance( filenames.size() );
for ( size_t i = 0 ; i != filenames.size() ; ++i )
{
std::vector< double > v( filenames.size() , 0 );
distance[i] = v;
}
//and now we can compute the scalar product:
for ( size_t i = 0 ; i != landscaspes.size() ; ++i )
{
for ( size_t j = i ; j != landscaspes.size() ; ++j )
{
distance[i][j] = distance[j][i] = compute_distance_of_landscapes_on_grid( landscaspes[i], landscaspes[j] , p ) ;
}
}
//and now output the result to the screen and a file:
std::ofstream out;
out.open( "distance" );
for ( size_t i = 0 ; i != distance.size() ; ++i )
{
for ( size_t j = 0 ; j != distance.size() ; ++j )
{
std::cout << distance[i][j] << " ";
out << distance[i][j] << " ";
}
std::cout << std::endl;
out << std::endl;
}
out.close();
return 0;
}
|
