diff options
Diffstat (limited to 'src/cython/doc/bottleneck_distance_sum.rst')
-rw-r--r-- | src/cython/doc/bottleneck_distance_sum.rst | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/src/cython/doc/bottleneck_distance_sum.rst b/src/cython/doc/bottleneck_distance_sum.rst index 6cffa122..6fec9b7e 100644 --- a/src/cython/doc/bottleneck_distance_sum.rst +++ b/src/cython/doc/bottleneck_distance_sum.rst @@ -1,15 +1,15 @@ -===================================== ===================================== ===================================== -:Author: Francois Godi :Introduced in: GUDHI 1.4.0 :Copyright: GPL v3 -===================================== ===================================== ===================================== -:Requires: CGAL ≥ 4.8.0 -===================================== ===================================== ===================================== +================================================================= =================================== =================================== +:Author: François Godi :Introduced in: GUDHI 2.0.0 :Copyright: GPL v3 +:Requires: CGAL :math:`\geq` 4.8.0 +================================================================= =================================== =================================== -+-------------------------------------------+----------------------------------------------------------------------+ -| .. image:: | Bottleneck distance measures the similarity between two persistence | -| img/perturb_pd.png | 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. | -+-------------------------------------------+----------------------------------------------------------------------+ -| :doc:`bottleneck_distance_user` | :doc:`bottleneck_distance_ref` | -+-------------------------------------------+----------------------------------------------------------------------+ ++-----------------------------------------------------------------+----------------------------------------------------------------------+ +| .. figure:: | Bottleneck distance measures the similarity between two persistence | +| img/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 | +| | diagonal points) such that any couple of matched points are at | +| Bottleneck distance is the length of | distance at most b. | +| the longest edge | | ++-----------------------------------------------------------------+----------------------------------------------------------------------+ +| :doc:`bottleneck_distance_user` | :doc:`bottleneck_distance_ref` | ++-----------------------------------------------------------------+----------------------------------------------------------------------+ |