summaryrefslogtreecommitdiff
path: root/src/cython/doc/bottleneck_distance_sum.inc
diff options
context:
space:
mode:
Diffstat (limited to 'src/cython/doc/bottleneck_distance_sum.inc')
-rw-r--r--src/cython/doc/bottleneck_distance_sum.inc4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/cython/doc/bottleneck_distance_sum.inc b/src/cython/doc/bottleneck_distance_sum.inc
index 41b9c5a3..6840e838 100644
--- a/src/cython/doc/bottleneck_distance_sum.inc
+++ b/src/cython/doc/bottleneck_distance_sum.inc
@@ -6,8 +6,8 @@
| ../../doc/Bottleneck_distance/perturb_pd.png | diagrams. It's the shortest distance b for which there exists a | |
| :figclass: align-center | perfect matching between the points of the two diagrams (+ all the | :Introduced in: GUDHI 2.0.0 |
| | diagonal points) such that any couple of matched points are at | |
- | Bottleneck distance is the length of | distance at most b. | :Copyright: GPL v3 |
- | the longest edge | | |
+ | Bottleneck distance is the length of | distance at most b, where the distance between points is the sup | :Copyright: GPL v3 |
+ | the longest edge | norm in :math:`\mathbb{R}^2`. | |
| | | :Requires: CGAL :math:`\geq` 4.8.0 |
+-----------------------------------------------------------------+----------------------------------------------------------------------+-----------------------------------------------+
| * :doc:`bottleneck_distance_user` | |