/* 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) 2016 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 .
*/
#include
#include
#include
#include
#include
using Persistence_landscape = Gudhi::Persistence_representations::Persistence_landscape;
int main(int argc, char** argv) {
std::cout << "This program computes distance of persistence landscapes stored in files (the files needs to be "
<< "created beforehand).\n"
<< "The first parameter of a program is an integer p. The program compute L^p distance of the two heat "
<< "maps. For L^infty distance choose p = -1. \n"
<< "The remaining parameters of this program are names of files with persistence landscapes.\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::max();
if (pp != -1) {
p = pp;
}
std::vector filenames;
for (int i = 2; i < argc; ++i) {
filenames.push_back(argv[i]);
}
std::vector landscaspes;
landscaspes.reserve(filenames.size());
for (size_t file_no = 0; file_no != filenames.size(); ++file_no) {
Persistence_landscape 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 > distance(filenames.size());
for (size_t i = 0; i != filenames.size(); ++i) {
std::vector v(filenames.size(), 0);
distance[i] = v;
}
// and now we can compute the distances:
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(landscaspes[i], landscaspes[j], p);
}
}
// and now output the result to the screen and a file:
std::ofstream out;
out.open("distance.land");
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();
std::cout << "Distance can be found in 'distance.land' file\n";
return 0;
}