23 #ifndef INCLUDE_NERVE_GIC_INTERFACE_H_ 24 #define INCLUDE_NERVE_GIC_INTERFACE_H_ 26 #include <gudhi/Simplex_tree.h> 28 #include <gudhi/GIC.h> 30 #include "Simplex_tree_interface.h" 38 namespace cover_complex {
40 class Nerve_gic_interface :
public Cover_complex<std::vector<double>> {
42 void create_simplex_tree(Simplex_tree_interface<>* simplex_tree) {
44 simplex_tree->initialize_filtration();
46 void set_cover_from_Euclidean_Voronoi(
int m) {
49 double set_graph_from_automatic_euclidean_rips(
int N) {
52 void set_graph_from_euclidean_rips(
double threshold) {
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