blob: 00e614f6a32c0ec8b683c24750043f2f5013ced6 (
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
|
/* 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): François 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 DOC_BOTTLENECK_DISTANCE_H_
#define DOC_BOTTLENECK_DISTANCE_H_
// needs namespace for Doxygen to link on classes
namespace Gudhi {
// needs namespace for Doxygen to link on classes
namespace bottleneck_distance {
/** \defgroup bottleneck_distance Bottleneck distance
*
* \author François Godi
* @{
*
* \section bottleneckdefinition Definition
*
* Bottleneck distance measures the similarity between two persistence diagrams.
* It's the shortest distance b for which there exists a perfect matching between
* the points of the two diagrams (+ all the diagonal points) such that
* any couple of matched points are at distance at most b.
*
* \image html perturb_pd.png Bottleneck distance is the length of the longest edge.
*
*/
/** @} */ // end defgroup bottleneck_distance
} // namespace bottleneck_distance
} // namespace Gudhi
|
