blob: 9a35b8b7df83af6e4af83358222a3318aaa3eb91 (
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
67
68
69
70
71
72
73
74
75
|
#ifndef FILTERED_TOPLEX_MAP_H
#define FILTERED_TOPLEX_MAP_H
#include <gudhi/Toplex_map.h>
#include <map>
#include <limits>
namespace Gudhi {
/** A Filtered_toplex_map represents the simplicial complex with a filtration.
* A "toplex" is a critical simplex. */
class Filtered_toplex_map {
public:
/** Vertex is the type of vertices. */
typedef Toplex_map::Vertex Vertex;
/** Simplex is the type of simplices. */
typedef Toplex_map::Simplex Simplex;
/** The type of the pointers to maximal simplices. */
typedef Toplex_map::Simplex_ptr Simplex_ptr;
/** The type of the sets of Simplex_ptr. */
typedef Toplex_map::Simplex_ptr_set Simplex_ptr_set;
/** The type of the filtration values. */
typedef double Filtration_value;
/** Add a simplex and its subfaces with the given filtration value
* in the Filtered_toplex_map. */
template <typename Input_vertex_range>
std::pair<Simplex, bool> insert_simplex_and_subfaces(const Input_vertex_range &vertex_range, Filtration_value f = std::numeric_limits<double>::quiet_NaN());
/** Gives the filtration of the input simplex. */
template <typename Input_vertex_range>
Filtration_value filtration(const Input_vertex_range &vertex_range) const;
/** Is the input simplex member of the complex ? */
template <typename Input_vertex_range>
bool membership(const Input_vertex_range &vertex_range) const;
protected:
std::map<Filtration_value, Toplex_map*> toplex_maps;
};
template <typename Input_vertex_range>
std::pair<Toplex_map::Simplex, bool> Filtered_toplex_map::insert_simplex_and_subfaces(const Input_vertex_range &vertex_range, Filtration_value f){
Simplex s(vertex_range.begin(),vertex_range.end());
if(membership(s)) return make_pair(s,false);
if(!toplex_maps.count(f)) toplex_maps.emplace(f,new Toplex_map());
toplex_maps.at(f)->insert_simplex(vertex_range);
return make_pair(s,true);
}
template <typename Input_vertex_range>
Filtered_toplex_map::Filtration_value Filtered_toplex_map::filtration(const Input_vertex_range &vertex_range) const{
for(auto kv : toplex_maps)
if(kv.second->membership(vertex_range))
return kv.first; //min only because a map is ordered
return std::numeric_limits<double>::quiet_NaN() ;
}
template <typename Input_vertex_range>
bool Filtered_toplex_map::membership(const Input_vertex_range &vertex_range) const{
for(auto kv : toplex_maps)
if(kv.second->membership(vertex_range))
return true;
return false;
}
} //namespace Gudhi
#endif /* FILTERED_TOPLEX_MAP_H */
|
