#include <gudhi/Tangential_complex.h>
#include <gudhi/sparsify_point_set.h>
#include <gudhi/Simplex_tree.h>
#include <CGAL/Epick_d.h>
#include <CGAL/Random.h>
#include <array>
#include <vector>
namespace tc = Gudhi::tangential_complex;
typedef CGAL::Epick_d<CGAL::Dynamic_dimension_tag> Kernel;
typedef Kernel::FT FT;
typedef Kernel::Point_d Point;
typedef Kernel::Vector_d Vector;
Kernel, CGAL::Dynamic_dimension_tag,
CGAL::Parallel_tag> TC;
int main(void) {
const int INTRINSIC_DIM = 2;
const int AMBIENT_DIM = 3;
const int NUM_POINTS = 100;
Kernel k;
// Generate points on a 2-sphere
CGAL::Random_points_on_sphere_d<Point> generator(AMBIENT_DIM, 3.);
std::vector<Point> points;
for (int i = 0; i < NUM_POINTS; ++i)
// Compute the TC
TC tc(points, INTRINSIC_DIM, k);
// Export the TC into a Simplex_tree
// Display stats about inconsistencies
tc.number_of_inconsistent_simplices(true); // verbose
return 0;
Simplex Tree data structure for representing simplicial complexes.
Definition: Simplex_tree.h:79
Tangential complex data structure.
Definition: Tangential_complex.h:125
void compute_tangential_complex()
Computes the tangential complex.
Definition: Tangential_complex.h:330
Num_inconsistencies number_of_inconsistent_simplices(bool verbose=false) const
Definition: Tangential_complex.h:551
int create_complex(Simplex_tree_ &tree, bool export_inconsistent_simplices=true) const
Exports the complex into a Simplex_tree.
Definition: Tangential_complex.h:610