/* 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 RIPS_COMPLEX_INTERFACE_H
#define 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:
Rips_complex_interface(std::vector>&values, double threshold, bool euclidean) {
if (euclidean) {
// Rips construction where values is a vector of points
rips_complex_ = new Rips_complex::Filtration_value>(values, threshold,
Euclidean_distance());
} else {
// Rips construction where values is a distance matrix
rips_complex_ = new Rips_complex::Filtration_value>(values, threshold);
}
}
Rips_complex_interface(std::string file_name, double threshold, bool euclidean, bool from_file = true) {
if (euclidean) {
// Rips construction where file_name is an OFF file
Gudhi::Points_off_reader off_reader(file_name);
rips_complex_ = new Rips_complex::Filtration_value>(off_reader.get_point_cloud(),
threshold, Euclidean_distance());
} else {
// Rips construction where values is a distance matrix
Distance_matrix distances = read_lower_triangular_matrix_from_csv_file::Filtration_value>(file_name);
rips_complex_ = new Rips_complex::Filtration_value>(distances, threshold);
}
}
void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, int dim_max) {
rips_complex_->create_complex(*simplex_tree, dim_max);
simplex_tree->initialize_filtration();
}
private:
Rips_complex::Filtration_value>* rips_complex_;
};
} // namespace rips_complex
} // namespace Gudhi
#endif // RIPS_COMPLEX_INTERFACE_H