23 #ifndef INCLUDE_WITNESS_COMPLEX_INTERFACE_H_ 24 #define INCLUDE_WITNESS_COMPLEX_INTERFACE_H_ 26 #include <gudhi/Simplex_tree.h> 27 #include <gudhi/Witness_complex.h> 29 #include "Simplex_tree_interface.h" 38 namespace witness_complex {
40 class Witness_complex_interface {
41 using Nearest_landmark_range = std::vector<std::pair<std::size_t, double>>;
42 using Nearest_landmark_table = std::vector<Nearest_landmark_range>;
45 Witness_complex_interface(
const Nearest_landmark_table& nlt) {
49 ~Witness_complex_interface() {
50 delete witness_complex_;
53 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
double max_alpha_square,
54 std::size_t limit_dimension) {
55 witness_complex_->
create_complex(*simplex_tree, max_alpha_square, limit_dimension);
56 simplex_tree->initialize_filtration();
59 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree,
60 double max_alpha_square) {
61 witness_complex_->create_complex(*simplex_tree, max_alpha_square);
62 simplex_tree->initialize_filtration();
73 #endif // INCLUDE_WITNESS_COMPLEX_INTERFACE_H_ bool create_complex(SimplicialComplexForWitness &complex, double max_alpha_square, std::size_t limit_dimension=std::numeric_limits< std::size_t >::max()) const
Outputs the (weak) witness complex of relaxation 'max_alpha_square' in a simplicial complex data stru...
Definition: Witness_complex.h:98
Constructs (weak) witness complex for given sets of witnesses and landmarks in Euclidean space...
Definition: Euclidean_witness_complex.h:49
Definition: SimplicialComplexForAlpha.h:26