.. table:: :widths: 30 40 30 +-----------------------------------------------------------------+----------------------------------------------------------------------+-----------------------------------------------------------------+ | .. figure:: | Bottleneck distance measures the similarity between two persistence | :Author: François Godi | | ../../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 | :Since: 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, where the distance between points is the sup | :License: MIT (`GPL v3 `_) | | the longest edge | norm in :math:`\mathbb{R}^2`. | | | | | :Requires: `CGAL `_ :math:`\geq` 4.11.0 | +-----------------------------------------------------------------+----------------------------------------------------------------------+-----------------------------------------------------------------+ | * :doc:`bottleneck_distance_user` | | +-----------------------------------------------------------------+----------------------------------------------------------------------------------------------------------------------------------------+