From b9a6a203a71eed7f17de219070ca24e448b53b9e Mon Sep 17 00:00:00 2001 From: Marc Glisse Date: Wed, 29 May 2019 14:17:00 +0200 Subject: Citations for bottleneck distance --- src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 3 +++ 1 file changed, 3 insertions(+) (limited to 'src/Bottleneck_distance/doc') 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 -- cgit v1.2.3