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
109
110
111
112
113
|
/* 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): Vincent Rouvreau
*
* Copyright (C) 2016 INRIA
*
* 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/>.
*/
#ifndef EUCLIDEAN_WITNESS_COMPLEX_INTERFACE_H
#define EUCLIDEAN_WITNESS_COMPLEX_INTERFACE_H
#include <gudhi/Simplex_tree.h>
#include <gudhi/Euclidean_witness_complex.h>
#include "Simplex_tree_interface.h"
#include <CGAL/Epick_d.h>
#include <vector>
#include <utility> // std::pair
#include <iostream>
#include <cstddef>
namespace Gudhi {
namespace witness_complex {
class Euclidean_witness_complex_interface {
using Dynamic_kernel = CGAL::Epick_d< CGAL::Dynamic_dimension_tag >;
using Point_d = Dynamic_kernel::Point_d;
typedef typename Simplex_tree<>::Simplex_key Simplex_key;
public:
Euclidean_witness_complex_interface(std::vector<std::vector<double>>&landmarks, std::vector<std::vector<double>>&witnesses)
: landmarks_(landmarks.begin(), landmarks.end()),
witnesses_(witnesses.begin(), witnesses.end()),
witness_complex_(landmarks_, witnesses_) {
}
Euclidean_witness_complex_interface(std::vector<Point_d>&landmarks, std::vector<Point_d>&witnesses)
: landmarks_(landmarks.begin(), landmarks.end()),
witnesses_(witnesses.begin(), witnesses.end()),
witness_complex_(landmarks_, witnesses_) {
}
void create_simplex_tree(Gudhi::Simplex_tree<>* simplex_tree, double max_alpha_square, std::size_t limit_dimension) {
witness_complex_.create_complex(*simplex_tree, max_alpha_square, limit_dimension);
simplex_tree->initialize_filtration();
}
void create_simplex_tree(Gudhi::Simplex_tree<>* simplex_tree, double max_alpha_square) {
witness_complex_.create_complex(*simplex_tree, max_alpha_square);
simplex_tree->initialize_filtration();
}
private:
std::vector<Point_d> landmarks_;
std::vector<Point_d> witnesses_;
Euclidean_witness_complex<Dynamic_kernel> witness_complex_;
};
/*template<typename Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>>
class Euclidean_witness_complex_interface : public Euclidean_witness_complex<Kernel> {
//class Euclidean_witness_complex_interface {
using Point_d = Kernel::Point_d;
public:
Euclidean_witness_complex_interface(const std::vector<std::vector<double>>& landmarks, const std::vector<std::vector<double>>& witnesses) {
: landmarks_(std::begin(landmarks), std::end(landmarks)),
witnesses_(std::begin(witnesses), std::end(witnesses)),
Gudhi::witness_complex::Euclidean_witness_complex<Kernel>(landmarks_, witnesses_) {
}
void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, double max_alpha_square,
std::size_t limit_dimension) {
create_complex(*simplex_tree, max_alpha_square, limit_dimension);
simplex_tree->initialize_filtration();
}
void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
double max_alpha_square) {
create_complex(*simplex_tree, max_alpha_square);
simplex_tree->initialize_filtration();
}
private:
// Euclidean_witness_complex<Kernel>* witness_complex_;
std::vector<Point_d> landmarks_;
std::vector<Point_d> witnesses_;
};*/
} // namespace witness_complex
} // namespace Gudhi
#endif // EUCLIDEAN_WITNESS_COMPLEX_INTERFACE_H
|
