blob: e403735c4efb38dfbdca9c5da6aa6770fb342d10 (
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/* 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): Francois Godi
*
* Copyright (C) 2015 INRIA Sophia-Antipolis (France)
*
* 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 SRC_BOTTLENECK_INCLUDE_GUDHI_PLANAR_NEIGHBORS_FINDER_H_
#define SRC_BOTTLENECK_INCLUDE_GUDHI_PLANAR_NEIGHBORS_FINDER_H_
#include <list>
#include <set>
#include "Persistence_diagrams_graph.h"
#include "Grid_cell.h"
namespace Gudhi {
namespace bottleneck {
/** \internal \brief Structure used to find any point in V near (according to the planar distance) to a query point from U.
*
* V points have to be added manually using their index and before the first remove/pull. A neighbor pulled is automatically removed. but we can also
* remove points manually using their index.
*
* \ingroup bottleneck_distance
*/
class Abstract_planar_neighbors_finder {
public:
/** \internal \brief Constructor TODO. */
Abstract_planar_neighbors_finder(double r);
virtual ~Abstract_planar_neighbors_finder() = 0;
/** \internal \brief A point added will be possibly pulled. */
virtual void add(int v_point_index) = 0;
/** \internal \brief A point manually removed will no longer be possibly pulled. */
virtual void remove(int v_point_index) = 0;
/** \internal \brief Can the point given as parameter be returned ? */
virtual bool contains(int v_point_index) const = 0;
/** \internal \brief Provide and remove a V point near to the U point given as parameter, null_point_index() if there isn't such a point. */
virtual int pull_near(int u_point_index) = 0;
/** \internal \brief Provide and remove all the V points near to the U point given as parameter. */
virtual std::unique_ptr< std::list<int> > pull_all_near(int u_point_index);
protected:
const double r;
};
/** \internal \brief Naive_pnf is an naïve Abstract_planar_neighbors_finder implementation
*
* \ingroup bottleneck_distance
*/
class Naive_pnf : public Abstract_planar_neighbors_finder {
public:
/** \internal \brief Constructor taking the near distance definition as parameter. */
Naive_pnf(double r);
/** \internal \brief A point added will be possibly pulled. */
void add(int v_point_index);
/** \internal \brief A point manually removed will no longer be possibly pulled. */
void remove(int v_point_index);
/** \internal \brief Can the point given as parameter be returned ? */
bool contains(int v_point_index) const;
/** \internal \brief Provide and remove a V point near to the U point given as parameter, null_point_index() if there isn't such a point. */
int pull_near(int u_point_index);
private:
std::set<int> candidates;
};
/** \internal \typedef \brief Planar_neighbors_finder is the used Abstract_planar_neighbors_finder's implementation. */
typedef Naive_pnf Planar_neighbors_finder;
inline Abstract_planar_neighbors_finder::Abstract_planar_neighbors_finder(double r) :
r(r) { }
inline Abstract_planar_neighbors_finder::~Abstract_planar_neighbors_finder() {}
inline std::unique_ptr< std::list<int> > Abstract_planar_neighbors_finder::pull_all_near(int u_point_index) {
std::unique_ptr< std::list<int> > all_pull(new std::list<int>);
int last_pull = pull_near(u_point_index);
while (last_pull != null_point_index()) {
all_pull->emplace_back(last_pull);
last_pull = pull_near(u_point_index);
}
return all_pull;
}
inline Naive_pnf::Naive_pnf(double r) :
Abstract_planar_neighbors_finder(r), candidates() { }
inline void Naive_pnf::add(int v_point_index) {
candidates.emplace(v_point_index);
}
inline void Naive_pnf::remove(int v_point_index) {
candidates.erase(v_point_index);
}
inline bool Naive_pnf::contains(int v_point_index) const {
return (candidates.count(v_point_index) > 0);
}
inline int Naive_pnf::pull_near(int u_point_index) {
for (auto it = candidates.begin(); it != candidates.end(); ++it)
if (G::distance(u_point_index, *it) <= r) {
int tmp = *it;
candidates.erase(it);
return tmp;
}
return null_point_index();
}
} // namespace bottleneck
} // namespace Gudhi
#endif // SRC_BOTTLENECK_INCLUDE_GUDHI_PLANAR_NEIGHBORS_FINDER_H_
|
