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
|
/* 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
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef INCLUDE_RIPS_COMPLEX_INTERFACE_H_
#define INCLUDE_RIPS_COMPLEX_INTERFACE_H_
#include <gudhi/Simplex_tree.h>
#include <gudhi/Rips_complex.h>
#include <gudhi/Sparse_rips_complex.h>
#include <gudhi/distance_functions.h>
#include <boost/optional.hpp>
#include "Simplex_tree_interface.h"
#include <iostream>
#include <vector>
#include <utility> // std::pair
#include <string>
namespace Gudhi {
namespace rips_complex {
class Rips_complex_interface {
using Point_d = std::vector<double>;
using Distance_matrix = std::vector<std::vector<Simplex_tree_interface<>::Filtration_value>>;
public:
void init_points(const std::vector<std::vector<double>>& points, double threshold) {
rips_complex_.emplace(points, threshold, Gudhi::Euclidean_distance());
}
void init_matrix(const std::vector<std::vector<double>>& matrix, double threshold) {
rips_complex_.emplace(matrix, threshold);
}
void init_points_sparse(const std::vector<std::vector<double>>& points, double threshold, double epsilon) {
sparse_rips_complex_.emplace(points, Gudhi::Euclidean_distance(), epsilon, -std::numeric_limits<double>::infinity(), threshold);
}
void init_matrix_sparse(const std::vector<std::vector<double>>& matrix, double threshold, double epsilon) {
sparse_rips_complex_.emplace(matrix, epsilon, -std::numeric_limits<double>::infinity(), threshold);
}
void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, int dim_max) {
if (rips_complex_)
rips_complex_->create_complex(*simplex_tree, dim_max);
else
sparse_rips_complex_->create_complex(*simplex_tree, dim_max);
simplex_tree->initialize_filtration();
}
private:
// std::variant would work, but we don't require C++17 yet, and boost::variant is not super convenient.
// Anyway, storing a graph would make more sense. Or changing the interface completely so there is no such storage.
boost::optional<Rips_complex<Simplex_tree_interface<>::Filtration_value>> rips_complex_;
boost::optional<Sparse_rips_complex<Simplex_tree_interface<>::Filtration_value>> sparse_rips_complex_;
};
} // namespace rips_complex
} // namespace Gudhi
#endif // INCLUDE_RIPS_COMPLEX_INTERFACE_H_
|
