#include <gudhi/Simplex_tree.h>
#include <gudhi/Euclidean_strong_witness_complex.h>
#include <gudhi/pick_n_random_points.h>
#include <gudhi/choose_n_farthest_points.h>
#include <gudhi/Points_off_io.h>
#include <CGAL/Epick_d.h>
#include <iostream>
#include <fstream>
#include <ctime>
#include <string>
#include <vector>
using K = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>;
using Point_d = typename K::Point_d;
using Point_vector = std::vector<Point_d>;
int main(int argc, char* const argv[]) {
if (argc != 5) {
std::cerr << "Usage: " << argv[0] << " path_to_point_file number_of_landmarks max_squared_alpha limit_dimension\n";
return 0;
}
std::string file_name = argv[1];
int nbL = atoi(argv[2]), lim_dim = atoi(argv[4]);
double alpha2 = atof(argv[3]);
clock_t start, end;
Point_vector point_vector, landmarks;
std::cerr << "Strong witness complex - Unable to read file " << file_name << "\n";
exit(-1);
}
std::clog << "Successfully read " << point_vector.size() << " points.\n";
std::clog << "Ambient dimension is " << point_vector[0].dimension() << ".\n";
std::back_inserter(landmarks));
start = clock();
end = clock();
std::clog << "Strong witness complex took " << static_cast<double>(end - start) / CLOCKS_PER_SEC << " s. \n";
std::clog <<
"Number of simplices is: " << simplex_tree.
num_simplices() <<
"\n";
}