/* 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_EUCLIDEAN_STRONG_WITNESS_COMPLEX_INTERFACE_H_
#define INCLUDE_EUCLIDEAN_STRONG_WITNESS_COMPLEX_INTERFACE_H_
#include
#include
#include "Simplex_tree_interface.h"
#include
#include
#include // std::pair
#include
#include
namespace Gudhi {
namespace witness_complex {
class Euclidean_strong_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_strong_witness_complex_interface(const std::vector>& landmarks,
const std::vector>& witnesses) {
landmarks_.reserve(landmarks.size());
for (auto& landmark : landmarks)
landmarks_.emplace_back(landmark.begin(), landmark.end());
witness_complex_ = new Euclidean_strong_witness_complex(landmarks_, witnesses);
}
~Euclidean_strong_witness_complex_interface() {
delete witness_complex_;
}
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();
}
std::vector get_point(unsigned vh) {
std::vector vd;
if (vh < landmarks_.size()) {
Point_d ph = witness_complex_->get_point(vh);
for (auto coord = ph.cartesian_begin(); coord < ph.cartesian_end(); coord++)
vd.push_back(*coord);
}
return vd;
}
private:
std::vector landmarks_;
Euclidean_strong_witness_complex* witness_complex_;
};
} // namespace witness_complex
} // namespace Gudhi
#endif // INCLUDE_EUCLIDEAN_STRONG_WITNESS_COMPLEX_INTERFACE_H_