diff options
| author | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-06-28 09:54:59 +0200 |
|---|---|---|
| committer | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-06-28 09:54:59 +0200 |
| commit | c7fcb08c78428913d848496da30eb713e85cc281 (patch) | |
| tree | 05226fe9ac0b829253f2696c24776c411f000058 /src/cython/doc/bottleneck_distance_sum.inc | |
| parent | 8014a88ab31bc2c0278824a3da65ba7ca17fdce9 (diff) | |
| parent | 695655d5cb347d809733a5fa1c0458fb98fd3272 (diff) | |
Merge branch 'master' into simplex_tree_insert_duplicated_vertices_fix_vincent
Diffstat (limited to 'src/cython/doc/bottleneck_distance_sum.inc')
| -rw-r--r-- | src/cython/doc/bottleneck_distance_sum.inc | 4 |
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` | | |