summaryrefslogtreecommitdiff
path: root/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
diff options
context:
space:
mode:
authorROUVREAU Vincent <vincent.rouvreau@inria.fr>2019-06-12 07:43:43 +0200
committerROUVREAU Vincent <vincent.rouvreau@inria.fr>2019-06-12 07:43:43 +0200
commitc65eba306f7fe2777f8851edb9fcb2d2592c27d2 (patch)
tree859605631b2560b22fdc51c450bf83912c2fca39 /src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
parent7e8685458f684f347b2aa6a77a288c249c722f25 (diff)
parentf58f0bb2cb99076d0cd3a11ad39f3277213e3f5e (diff)
Merge branch 'master' into persistence_intervals_numpy_arrays_vincent
Diffstat (limited to 'src/Bottleneck_distance/doc/Intro_bottleneck_distance.h')
-rw-r--r--src/Bottleneck_distance/doc/Intro_bottleneck_distance.h3
1 files changed, 3 insertions, 0 deletions
diff --git a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
index f8fce96c..6fd058a8 100644
--- a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
+++ b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
@@ -41,6 +41,9 @@ namespace persistence_diagram {
*
* \image html perturb_pd.png On this picture, the red edges represent the matching. The bottleneck distance is the length of the longest edge.
*
+ * This implementation is based on ideas from "Geometry Helps in Bottleneck Matching and Related Problems"
+ * \cite DBLP:journals/algorithmica/EfratIK01. Another relevant publication, although it was not used is
+ * "Geometry Helps to Compare Persistence Diagrams" \cite Kerber:2017:GHC:3047249.3064175.
*/
/** @} */ // end defgroup bottleneck_distance