diff options
Diffstat (limited to 'src/Bottleneck_distance/doc/Intro_bottleneck_distance.h')
| -rw-r--r-- | src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h index 795bcbea..00e614f6 100644 --- a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h +++ b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h @@ -30,17 +30,17 @@ namespace bottleneck_distance { /** \defgroup bottleneck_distance Bottleneck distance * - * \author François Godi + * \author François Godi * @{ * * \section bottleneckdefinition Definition * - * Bottleneck distance mesures the similarity between two persistence diagrams. + * 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 La bottleneck distance est la longueur de la plus longue arête. + * \image html perturb_pd.png Bottleneck distance is the length of the longest edge. * */ /** @} */ // end defgroup bottleneck_distance |