Cech complex class.
More...
#include <include/gudhi/Cech_complex.h>
|
| template<typename InputPointRange > |
| | Cech_complex (const InputPointRange &points, Filtration_value max_radius, const bool exact=false) |
| | Cech_complex constructor from a range of points. More...
|
| |
| void | create_complex (SimplicialComplexForCechComplex &complex, int dim_max) |
| | Initializes the simplicial complex from the proximity graph and expands it until a given maximal dimension, using the Cech blocker oracle. More...
|
| |
| Filtration_value | max_radius () const |
| |
| const Point_d & | get_point (Vertex_handle vertex) const |
| |
| std::vector< Sphere > & | get_cache () |
| |
| const bool | is_exact () |
| | Check exact option. More...
|
| |
template<typename Kernel, typename SimplicialComplexForCechComplex>
class Gudhi::cech_complex::Cech_complex< Kernel, SimplicialComplexForCechComplex >
Cech complex class.
Cech complex is a simplicial complex where the set of all simplices is filtered by the radius of their minimal enclosing ball and bounded by the given max_radius.
- Template Parameters
-
| Kernel | CGAL kernel: either Epick_d or Epeck_d. |
| SimplicialComplexForCechComplex | furnishes Vertex_handle and Filtration_value type definition required by Gudhi::Proximity_graph and Cech blocker. |
- Examples
- cech_complex_example_from_points.cpp, and cech_persistence.cpp.
◆ Cech_complex()
template<typename Kernel , typename SimplicialComplexForCechComplex >
template<typename InputPointRange >
| Gudhi::cech_complex::Cech_complex< Kernel, SimplicialComplexForCechComplex >::Cech_complex |
( |
const InputPointRange & |
points, |
|
|
Filtration_value |
max_radius, |
|
|
const bool |
exact = false |
|
) |
| |
|
inline |
Cech_complex constructor from a range of points.
- Parameters
-
| [in] | points | Range of points where each point is defined as kernel::Point_d. |
| [in] | max_radius | Maximal radius value. |
| [in] | exact | Exact filtration values computation. Not exact if Kernel is not CGAL::Epeck_d. Default is false. |
◆ create_complex()
template<typename Kernel , typename SimplicialComplexForCechComplex >
Initializes the simplicial complex from the proximity graph and expands it until a given maximal dimension, using the Cech blocker oracle.
- Parameters
-
- Exceptions
-
| std::invalid_argument | In debug mode, if `complex.num_vertices()` does not return 0. |
◆ get_cache()
template<typename Kernel , typename SimplicialComplexForCechComplex >
- Returns
- Vector of cached spheres.
◆ get_point()
template<typename Kernel , typename SimplicialComplexForCechComplex >
- Parameters
-
| [in] | vertex | Point position in the range. |
- Returns
- The point.
◆ is_exact()
template<typename Kernel , typename SimplicialComplexForCechComplex >
Check exact option.
- Returns
- Exact option.
◆ max_radius()
template<typename Kernel , typename SimplicialComplexForCechComplex >
- Returns
- max_radius value given at construction.
The documentation for this class was generated from the following file: