blob: 89231eec116af9c1b9daf512d61f6c6588a8758e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Vincent Rouvreau
*
* Copyright (C) 2018 Inria
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_
#define CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_
namespace Gudhi {
namespace cech_complex {
/** \brief The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial
* complex, that can be created from a `Cech_complex`.
*/
struct SimplicialComplexForCech {
/** Handle to specify a simplex. */
typedef unspecified Simplex_handle;
/** Handle to specify a vertex. Must be a non-negative integer. */
typedef unspecified Vertex_handle;
/** Handle to specify the simplex filtration value. */
typedef unspecified Filtration_value;
/** Assigns the 'simplex' with the given 'filtration' value. */
int assign_filtration(Simplex_handle simplex, Filtration_value filtration);
/** \brief Returns a range over vertices of a given
* simplex. */
Simplex_vertex_range simplex_vertex_range(Simplex_handle const & simplex);
/** \brief Inserts a given `Gudhi::ProximityGraph` in the simplicial complex. */
template<class ProximityGraph>
void insert_graph(const ProximityGraph& proximity_graph);
/** \brief Expands the simplicial complex containing only its one skeleton until a given maximal dimension.
* expansion can be blocked by the blocker oracle. */
template< typename Blocker >
void expansion_with_blockers(int max_dim, Blocker block_simplex);
/** Returns the number of vertices in the simplicial complex. */
std::size_t num_vertices();
};
} // namespace alpha_complex
} // namespace Gudhi
#endif // CONCEPT_ALPHA_COMPLEX_SIMPLICIAL_COMPLEX_FOR_ALPHA_H_
|
