Cech complex data structure. More...
Public Member Functions | |
Cech_complex (const ForwardPointRange &points, Filtration_value max_radius) | |
Cech_complex constructor from a list of points. More... | |
template<typename SimplicialComplexForCechComplex > | |
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 & | get_point (Vertex_handle vertex) const |
Cech complex data structure.
The data structure is a proximity graph, containing edges when the edge length is less or equal to a given max_radius. Edge length is computed from Gudhi::Minimal_enclosing_ball_radius
distance function.
SimplicialComplexForProximityGraph | furnishes Vertex_handle and Filtration_value type definition required by Gudhi::Proximity_graph . |
ForwardPointRange | must be a range for which std::begin() and std::end() methods return input iterators on a point. std::begin() and std::end() methods are also required for a point. |
|
inline |
Cech_complex constructor from a list of points.
[in] | points | Range of points. |
[in] | max_radius | Maximal radius value. |
ForwardPointRange | must be a range of Point. Point must be a range of copyable Cartesian coordinates. |
|
inline |
Initializes the simplicial complex from the proximity graph and expands it until a given maximal dimension, using the Cech blocker oracle.
[in] | complex | SimplicialComplexForCech to be created. |
[in] | dim_max | graph expansion until this given maximal dimension. |
std::invalid_argument | In debug mode, if complex.num_vertices() does not return 0. |
|
inline |
[in] | vertex | Point position in the range. |
|
inline |
GUDHI Version 3.1.1 - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding. - Copyright : MIT | Generated on Fri Feb 7 2020 16:35:36 for GUDHI by Doxygen 1.8.13 |