Nerve_gic_interface.h
1 /* This file is part of the Gudhi Library. The Gudhi library
2  * (Geometric Understanding in Higher Dimensions) is a generic C++
3  * library for computational topology.
4  *
5  * Author(s): Vincent Rouvreau
6  *
7  * Copyright (C) 2018 Inria
8  *
9  * This program is free software: you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation, either version 3 of the License, or
12  * (at your option) any later version.
13  *
14  * This program is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17  * GNU General Public License for more details.
18  *
19  * You should have received a copy of the GNU General Public License
20  * along with this program. If not, see <http://www.gnu.org/licenses/>.
21  */
22 
23 #ifndef INCLUDE_NERVE_GIC_INTERFACE_H_
24 #define INCLUDE_NERVE_GIC_INTERFACE_H_
25 
26 #include <gudhi/Simplex_tree.h>
28 #include <gudhi/GIC.h>
29 
30 #include "Simplex_tree_interface.h"
31 
32 #include <iostream>
33 #include <vector>
34 #include <string>
35 
36 namespace Gudhi {
37 
38 namespace cover_complex {
39 
40 class Nerve_gic_interface : public Cover_complex<std::vector<double>> {
41  public:
42  void create_simplex_tree(Simplex_tree_interface<>* simplex_tree) {
43  create_complex(*simplex_tree);
44  simplex_tree->initialize_filtration();
45  }
46  void set_cover_from_Euclidean_Voronoi(int m) {
48  }
49  double set_graph_from_automatic_euclidean_rips(int N) {
51  }
52  void set_graph_from_euclidean_rips(double threshold) {
54  }
55 };
56 
57 } // namespace cover_complex
58 
59 } // namespace Gudhi
60 
61 #endif // INCLUDE_NERVE_GIC_INTERFACE_H_
Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension.
Definition: distance_functions.h:46
Definition: SimplicialComplexForAlpha.h:26
void create_complex(SimplicialComplex &complex)
Creates the simplicial complex.
Definition: GIC.h:1262
void set_cover_from_Voronoi(Distance distance, int m=100)
Creates the cover C from the Voronoï cells of a subsampling of the point cloud.
Definition: GIC.h:853
Global distance functions.
void set_graph_from_rips(double threshold, Distance distance)
Creates a graph G from a Rips complex.
Definition: GIC.h:350
double set_graph_from_automatic_rips(Distance distance, int N=100)
Creates a graph G from a Rips complex whose threshold value is automatically tuned with subsampling—...
Definition: GIC.h:425
GUDHI  Version 2.3.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : GPL v3 Generated on Fri Oct 5 2018 15:05:03 for GUDHI by Doxygen 1.8.13