|
template<typename Point_range > |
| Tangential_complex (Point_range points, int intrinsic_dimension, const K &k=K()) |
| Constructor from a range of points. Points are copied into the instance, and a search data structure is initialized. Note the complex is not computed: compute_tangential_complex must be called after the creation of the object. More...
|
|
| ~Tangential_complex () |
| Destructor.
|
|
int | intrinsic_dimension () const |
| Returns the intrinsic dimension of the manifold.
|
|
int | ambient_dimension () const |
| Returns the ambient dimension.
|
|
Point | get_point (std::size_t vertex) const |
| Returns the point corresponding to the vertex given as parameter. More...
|
|
Point | get_perturbed_point (std::size_t vertex) const |
| Returns the perturbed position of the point corresponding to the vertex given as parameter. More...
|
|
std::size_t | number_of_vertices () const |
| Returns the number of vertices.
|
|
void | compute_tangential_complex () |
| Computes the tangential complex. More...
|
|
Fix_inconsistencies_info | fix_inconsistencies_using_perturbation (double max_perturb, double time_limit=-1.) |
| Attempts to fix inconsistencies by perturbing the point positions. More...
|
|
Num_inconsistencies | number_of_inconsistent_simplices (bool verbose=false) const |
|
template<typename Simplex_tree_ > |
int | create_complex (Simplex_tree_ &tree, bool export_inconsistent_simplices=true) const |
| Exports the complex into a Simplex_tree. More...
|
|
void | set_max_squared_edge_length (FT max_squared_edge_length) |
| Sets the maximal possible squared edge length for the edges in the triangulations. More...
|
|
template<typename Kernel_, typename DimensionTag, typename Concurrency_tag = CGAL::Parallel_tag, typename Triangulation_ = CGAL::Default>
class Gudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >
Tangential complex data structure.
The class Tangential_complex represents a tangential complex. After the computation of the complex, an optional post-processing called perturbation can be run to attempt to remove inconsistencies.
- Template Parameters
-
Kernel_ | requires a CGAL::Epick_d class, which can be static if you know the ambiant dimension at compile-time, or dynamic if you don't. |
DimensionTag | can be either Dimension_tag<d> if you know the intrinsic dimension at compile-time, or CGAL::Dynamic_dimension_tag if you don't. |
Concurrency_tag | enables sequential versus parallel computation. Possible values are CGAL::Parallel_tag (the default) and CGAL::Sequential_tag . |
Triangulation_ | is the type used for storing the local regular triangulations. We highly recommend to use the default value (CGAL::Regular_triangulation ). |
- Examples
- example_basic.cpp, and example_with_perturb.cpp.
template<typename Kernel_ , typename DimensionTag , typename Concurrency_tag = CGAL::Parallel_tag, typename Triangulation_ = CGAL::Default>
template<typename Point_range >
Constructor from a range of points. Points are copied into the instance, and a search data structure is initialized. Note the complex is not computed: compute_tangential_complex
must be called after the creation of the object.
- Parameters
-
[in] | points | Range of points (Point_range::value_type must be the same as Kernel_::Point_d ). |
[in] | intrinsic_dimension | Intrinsic dimension of the manifold. |
[in] | k | Kernel instance. |