/* This file is part of the Gudhi Library - - which is released under MIT.
* See file LICENSE or go to for full license details.
* Author(s): Mathieu Carrière
* Copyright (C) 2017 Inria
* Modification(s):
* - YYYY/MM Author: Description of the modification
#include <gudhi/GIC.h>
#include <string>
#include <vector>
void usage(int nbArgs, char *const progName) {
std::cerr << "Error: Number of arguments (" << nbArgs << ") is not correct\n";
std::cerr << "Usage: " << progName << " coordinate resolution gain [-v] \n";
std::cerr << " i.e.: " << progName << " ../../data/points/ 2 10 0.3 -v \n";
exit(-1); // ----- >>
int main(int argc, char **argv) {
if ((argc != 5) && (argc != 6)) usage(argc, argv[0]);
using Point = std::vector<float>;
std::string off_file_name(argv[1]);
int coord = atoi(argv[2]);
int resolution = atoi(argv[3]);
double gain = atof(argv[4]);
bool verb = 0;
if (argc == 6) verb = 1;
// --------------------------------
// Init of a Nerve from an OFF file
// --------------------------------
bool check = SC.read_point_cloud(off_file_name);
if (!check) {
std::clog << "Incorrect OFF file." << std::endl;
} else {
// ----------------------------------------------------------------------------
// Display information about the graph induced complex
// ----------------------------------------------------------------------------
if (verb) {
std::clog << "Nerve is of dimension " << stree.dimension() << " - " << stree.num_simplices() << " simplices - "
<< stree.num_vertices() << " vertices." << std::endl;
std::clog << "Iterator on Nerve simplices" << std::endl;
for (auto f_simplex : stree.filtration_simplex_range()) {
for (auto vertex : stree.simplex_vertex_range(f_simplex)) {
std::clog << vertex << " ";
std::clog << std::endl;
return 0;
Simplex Tree data structure for representing simplicial complexes.
Definition: Simplex_tree.h:75
Filtration_simplex_range const & filtration_simplex_range(Indexing_tag=Indexing_tag())
Returns a range over the simplices of the simplicial complex, in the order of the filtration.
Definition: Simplex_tree.h:262
Simplex_vertex_range simplex_vertex_range(Simplex_handle sh) const
Returns a range over the vertices of a simplex.
Definition: Simplex_tree.h:273
size_t num_vertices() const
Returns the number of vertices in the complex.
Definition: Simplex_tree.h:546
int dimension(Simplex_handle sh)
Returns the dimension of a simplex.
Definition: Simplex_tree.h:574
size_t num_simplices()
returns the number of simplices in the simplex_tree.
Definition: Simplex_tree.h:552
Cover complex data structure.
Definition: GIC.h:87
void set_resolution_with_interval_number(int reso)
Sets a number of intervals from a value stored in memory.
Definition: GIC.h:599
Persistence_diagram compute_PD()
Computes the extended persistence diagram of the complex.
Definition: GIC.h:1139
void create_complex(SimplicialComplex &complex)
Creates the simplicial complex.
Definition: GIC.h:1292
void set_type(const std::string &t)
Specifies whether the type of the output simplicial complex.
Definition: GIC.h:176
void find_simplices()
Computes the simplices of the simplicial complex.
Definition: GIC.h:1306
void set_cover_from_function()
Creates a cover C from the preimages of the function f.
Definition: GIC.h:611
void write_info()
Creates a .txt file called SC.txt describing the 1-skeleton, which can then be plotted with e....
Definition: GIC.h:1052
void set_gain(double g=0.3)
Sets a gain from a value stored in memory (default value 0.3).
Definition: GIC.h:605
void set_function_from_coordinate(int k)
Creates the function f from the k-th coordinate of the point cloud P.
Definition: GIC.h:514
void set_color_from_coordinate(int k=0)
Computes the function used to color the nodes of the simplicial complex from the k-th coordinate.
Definition: GIC.h:975
void set_graph_from_OFF()
Creates a graph G from the triangulation given by the input .OFF file.
Definition: GIC.h:332
bool read_point_cloud(const std::string &off_file_name)
Reads and stores the input point cloud from .(n)OFF file.
Definition: GIC.h:232
void set_verbose(bool verb=false)
Specifies whether the program should display information or not.
Definition: GIC.h:184
GUDHI  Version 3.5.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Thu Jan 13 2022 08:34:27 for GUDHI by Doxygen 1.9.2