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
|
/* 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): Mathieu Carriere
*
* Copyright (C) 2018 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_exact.h>
#include <iostream>
#include <vector>
#include <utility>
using Persistence_diagram = Gudhi::Persistence_representations::Persistence_diagram;
using LS = Gudhi::Persistence_representations::Persistence_landscape_on_grid_exact;
int main(int argc, char** argv) {
Persistence_diagram persistence;
persistence.push_back(std::make_pair(1, 2));
persistence.push_back(std::make_pair(6, 8));
persistence.push_back(std::make_pair(0, 4));
persistence.push_back(std::make_pair(3, 8));
int nb_ls = 2; double min_x = 0; double max_x = 8; int res_x = 1000;
LS ls(persistence, nb_ls, min_x, max_x, res_x);
std::vector<std::vector<double> > L = ls.vectorize();
for(int i = 0; i < nb_ls; i++){
for(int j = 0; j < res_x; j++) std::cout << L[i][j] << ", ";
std::cout << std::endl;
}
return 0;
}
|
