blob: ec461f7ca12d96835561db3f4882267a89c89a18 (
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
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Marc Glisse
*
* Copyright (C) 2020 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#include <pybind11_diagram_utils.h>
#ifdef _MSC_VER
// https://github.com/grey-narn/hera/issues/3
// ssize_t is a non-standard type (well, posix)
using py::ssize_t;
#endif
#include <hera/bottleneck.h> // Hera
double bottleneck_distance(Dgm d1, Dgm d2, double delta)
{
// I *think* the call to request() has to be before releasing the GIL.
auto diag1 = numpy_to_range_of_pairs(d1);
auto diag2 = numpy_to_range_of_pairs(d2);
py::gil_scoped_release release;
if (delta == 0)
return hera::bottleneckDistExact(diag1, diag2);
else
return hera::bottleneckDistApprox(diag1, diag2, delta);
}
PYBIND11_MODULE(bottleneck, m) {
m.def("bottleneck_distance", &bottleneck_distance,
py::arg("X"), py::arg("Y"),
py::arg("delta") = .01,
R"pbdoc(
Compute the Bottleneck distance between two diagrams.
Points at infinity are supported.
.. note::
Points on the diagonal are not supported and must be filtered out before calling this function.
Parameters:
X (n x 2 numpy array): First diagram
Y (n x 2 numpy array): Second diagram
delta (float): Relative error 1+delta
Returns:
float: (approximate) bottleneck distance d_B(X,Y)
)pbdoc");
}
|
