#include <gudhi/Persistence_landscape.h>
#include <iostream>
#include <vector>
#include <utility>
int main(int argc, char** argv) {
std::vector<std::pair<double, double> > persistence1;
std::vector<std::pair<double, double> > persistence2;
persistence1.push_back(std::make_pair(1, 2));
persistence1.push_back(std::make_pair(6, 8));
persistence1.push_back(std::make_pair(0, 4));
persistence1.push_back(std::make_pair(3, 8));
persistence2.push_back(std::make_pair(2, 9));
persistence2.push_back(std::make_pair(1, 6));
persistence2.push_back(std::make_pair(3, 5));
persistence2.push_back(std::make_pair(6, 10));
std::clog << "l1 : " << l1 << std::endl;
std::clog << "l2 : " << l2 << std::endl;
std::clog << "sum : " << sum << std::endl;
std::clog <<
"L^1 Norm of l1 : " << l1.
compute_norm_of_landscape(1.) << std::endl;
std::clog << "L^1 Norm of l2 : " << l2.compute_norm_of_landscape(1.) << std::endl;
std::clog << "average : " << average << std::endl;
std::clog <<
"Distance : " << l1.
distance(l2) << std::endl;
average.
plot(
"average_landscape");
return 0;
}
A class implementing persistence landscapes data structures.
Definition: Persistence_landscape.h:60
double compute_scalar_product(const Persistence_landscape &second) const
Definition: Persistence_landscape.h:414
double compute_integral_of_landscape() const
Definition: Persistence_landscape.h:661
double distance(const Persistence_landscape &second, double power=1) const
Definition: Persistence_landscape.h:401
double compute_maximum() const
Definition: Persistence_landscape.h:217
void compute_average(const std::vector< Persistence_landscape * > &to_average)
Definition: Persistence_landscape.h:342