/* 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 .
*/
#ifndef INCLUDE_RIPS_COMPLEX_INTERFACE_H_
#define INCLUDE_RIPS_COMPLEX_INTERFACE_H_
#include
#include
#include
#include
#include
#include "Simplex_tree_interface.h"
#include
#include
#include // std::pair
#include
namespace Gudhi {
namespace rips_complex {
class Rips_complex_interface {
using Point_d = std::vector;
using Distance_matrix = std::vector::Filtration_value>>;
public:
void init_points(const std::vector>& points, double threshold) {
rips_complex_.emplace(points, threshold, Gudhi::Euclidean_distance());
}
void init_matrix(const std::vector>& matrix, double threshold) {
rips_complex_.emplace(matrix, threshold);
}
void init_points_sparse(const std::vector>& points, double threshold, double epsilon) {
sparse_rips_complex_.emplace(points, Gudhi::Euclidean_distance(), epsilon, -std::numeric_limits::infinity(), threshold);
}
void init_matrix_sparse(const std::vector>& matrix, double threshold, double epsilon) {
sparse_rips_complex_.emplace(matrix, epsilon, -std::numeric_limits::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::Filtration_value>> rips_complex_;
boost::optional::Filtration_value>> sparse_rips_complex_;
};
} // namespace rips_complex
} // namespace Gudhi
#endif // INCLUDE_RIPS_COMPLEX_INTERFACE_H_