blob: 3a5d1fd5b1bf73abf2a5630a7a624d97c2c76d1a (
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
|
/* 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): Clément Maria
*
* Copyright (C) 2014 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 DISTANCE_FUNCTIONS_H_
#define DISTANCE_FUNCTIONS_H_
#include <gudhi/Debug_utils.h>
#include <boost/range/metafunctions.hpp>
#include <cmath> // for std::sqrt
#include <type_traits> // for std::decay
#include <iterator> // for std::begin, std::end
#include <utility>
namespace Gudhi {
/** @file
* @brief Global distance functions
*/
/** @brief Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to
* have the same dimension. */
class Euclidean_distance {
public:
// boost::range_value is not SFINAE-friendly so we cannot use it in the return type
template< typename Point >
typename std::iterator_traits<typename boost::range_iterator<Point>::type>::value_type
operator()(const Point& p1, const Point& p2) const {
auto it1 = std::begin(p1);
auto it2 = std::begin(p2);
typedef typename boost::range_value<Point>::type NT;
NT dist = 0;
for (; it1 != std::end(p1); ++it1, ++it2) {
GUDHI_CHECK(it2 != std::end(p2), "inconsistent point dimensions");
NT tmp = *it1 - *it2;
dist += tmp*tmp;
}
GUDHI_CHECK(it2 == std::end(p2), "inconsistent point dimensions");
using std::sqrt;
return sqrt(dist);
}
template< typename T >
T operator() (const std::pair< T, T >& f, const std::pair< T, T >& s) const {
T dx = f.first - s.first;
T dy = f.second - s.second;
using std::sqrt;
return sqrt(dx*dx + dy*dy);
}
};
} // namespace Gudhi
#endif // DISTANCE_FUNCTIONS_H_
|