diff options
Diffstat (limited to 'doc/Bottleneck_distance/Intro_bottleneck_distance.h')
| -rw-r--r-- | doc/Bottleneck_distance/Intro_bottleneck_distance.h | 51 |
1 files changed, 0 insertions, 51 deletions
diff --git a/doc/Bottleneck_distance/Intro_bottleneck_distance.h b/doc/Bottleneck_distance/Intro_bottleneck_distance.h deleted file mode 100644 index f8fce96c..00000000 --- a/doc/Bottleneck_distance/Intro_bottleneck_distance.h +++ /dev/null @@ -1,51 +0,0 @@ -/* 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: François Godi - * - * Copyright (C) 2015 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 DOC_BOTTLENECK_DISTANCE_INTRO_BOTTLENECK_DISTANCE_H_ -#define DOC_BOTTLENECK_DISTANCE_INTRO_BOTTLENECK_DISTANCE_H_ - -// needs namespace for Doxygen to link on classes -namespace Gudhi { -// needs namespace for Doxygen to link on classes -namespace persistence_diagram { - -/** \defgroup bottleneck_distance Bottleneck distance - * - * \author François Godi - * @{ - * - * \section bottleneckdefinition Definition - * - * The bottleneck distance measures the similarity between two persistence diagrams. It is the shortest distance b for - * which there exists a perfect matching between the points of the two diagrams (completed with all the points on the - * diagonal in order to ignore cardinality mismatchs) such that any couple of matched points are at distance at most b. - * - * \image html perturb_pd.png On this picture, the red edges represent the matching. The bottleneck distance is the length of the longest edge. - * - */ -/** @} */ // end defgroup bottleneck_distance - -} // namespace persistence_diagram - -} // namespace Gudhi - -#endif // DOC_BOTTLENECK_DISTANCE_INTRO_BOTTLENECK_DISTANCE_H_ |