Persistence_representations/persistence_landscapes/compute_distance_of_landscapes.cpp
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Pawel Dlotko
*
* Copyright (C) 2016 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#include <gudhi/Persistence_landscape.h>
#include <iostream>
#include <sstream>
#include <limits>
#include <vector>
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<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> landscaspes;
landscaspes.reserve(filenames.size());
for (size_t file_no = 0; file_no != filenames.size(); ++file_no) {
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 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;
}
GUDHI  Version 3.1.1  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Fri Feb 7 2020 16:35:36 for GUDHI by Doxygen 1.8.13