Cubical complex represented as a bitmap.
More...
#include <include/gudhi/Bitmap_cubical_complex.h>
template<typename T>
class Gudhi::cubical_complex::Bitmap_cubical_complex< T >
Cubical complex represented as a bitmap.
This is a Bitmap_cubical_complex class. It joints a functionalities of Bitmap_cubical_complex_base and Bitmap_cubical_complex_periodic_boundary_conditions_base classes into Gudhi persistent homology engine. It is a template class that inherit from its template parameter. The template parameter is supposed to be either Bitmap_cubical_complex_base or Bitmap_cubical_complex_periodic_boundary_conditions_base class.
This class implements the concept FilteredComplex.
- Examples
- Random_bitmap_cubical_complex.cpp, cubical_complex_persistence.cpp, and periodic_cubical_complex_persistence.cpp.
◆ Boundary_simplex_iterator
Boundary_simplex_range class provides ranges for boundary iterators.
◆ Filtration_simplex_range
Range of all the cells in filtration order. Secondary criteria for filtration are: (1) Dimension of a cube (lower dimensional comes first). (2) Position in the data structure (the ones that are earliest in the data structure come first).
◆ Bitmap_cubical_complex() [1/3]
◆ Bitmap_cubical_complex() [2/3]
- Parameters
-
| [in] | dimensions | The shape that should be used to interpret cells (in Fortran order). |
| [in] | cells | The filtration values of the top-dimensional cells if input_top_cells is true, and of the vertices otherwise. |
| [in] | input_top_cells | If true, cells represents top-dimensional cells. If false, it represents vertices. |
◆ Bitmap_cubical_complex() [3/3]
template<typename T >
| Gudhi::cubical_complex::Bitmap_cubical_complex< T >::Bitmap_cubical_complex |
( |
const std::vector< unsigned > & |
dimensions, |
|
|
const std::vector< Filtration_value > & |
cells, |
|
|
const std::vector< bool > & |
directions_in_which_periodic_b_cond_are_to_be_imposed, |
|
|
bool |
input_top_cells = true |
|
) |
| |
|
inline |
- Parameters
-
| [in] | dimensions | The shape that should be used to interpret cells (in Fortran order). |
| [in] | cells | The filtration values of the top-dimensional cells if input_top_cells is true, and of the vertices otherwise. |
| [in] | directions_in_which_periodic_b_cond_are_to_be_imposed | Specifies for each dimension (as per dimensions) if the space is periodic (true) or not (false), or in other words if the boundaries should be identified. |
| [in] | input_top_cells | If true, cells represents top-dimensional cells. If false, it represents vertices. |
◆ ~Bitmap_cubical_complex()
◆ assign_key()
Assign key to a cube pointed by the Simplex_handle
◆ boundary_simplex_range()
boundary_simplex_range creates an object of a Boundary_simplex_range class that provides ranges for the Boundary_simplex_iterator.
◆ dimension() [1/2]
Returns dimension of the complex.
◆ dimension() [2/2]
Return dimension of a cell pointed by the Simplex_handle.
◆ endpoints()
Returns the extremities of edge e
◆ filtration()
Return the filtration of a cell pointed by the Simplex_handle.
◆ filtration_simplex_range()
Range of all the cells in filtration order. Secondary criteria for filtration are: (1) Dimension of a cube (lower dimensional comes first). (2) Position in the data structure (the ones that are earliest in the data structure come first).
◆ initialize_filtration()
◆ key()
Return the key of a cube pointed by the Simplex_handle.
◆ null_key()
Return a key which is not a key of any cube in the considered data structure.
◆ null_simplex()
Returns a Simplex_handle to a cube that do not exist in this complex.
◆ num_simplices()
Returns number of all cubes in the complex.
◆ simplex()
◆ skeleton_simplex_range()
Function needed for compatibility with Gudhi. Not useful for other purposes.
The documentation for this class was generated from the following file:
