| ambient_dimension() const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| compute_tangential_complex() | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| create_complex(Simplex_tree_ &tree, bool export_inconsistent_simplices=true) const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| fix_inconsistencies_using_perturbation(double max_perturb, double time_limit=-1.) | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| get_perturbed_point(std::size_t vertex) const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| get_point(std::size_t vertex) const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| intrinsic_dimension() const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| number_of_inconsistent_simplices(bool verbose=false) const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| number_of_vertices() const | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| set_max_squared_edge_length(FT max_squared_edge_length) | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| Tangential_complex(Point_range points, int intrinsic_dimension, const K &k=K()) | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
| ~Tangential_complex() | Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ > | inline |
