summaryrefslogtreecommitdiff
path: root/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
diff options
context:
space:
mode:
authorVincent Rouvreau <VincentRouvreau@users.noreply.github.com>2019-06-03 15:34:36 +0200
committerGitHub <noreply@github.com>2019-06-03 15:34:36 +0200
commit7705d6ceac3d8a302b1950f77565f44a15122a30 (patch)
tree76a930e4ada82eb1a70a021b7f13d13319606438 /src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
parenta227bc0be7c5ee70ff45f6ee06da9be0553b1937 (diff)
parentb9a6a203a71eed7f17de219070ca24e448b53b9e (diff)
Merge pull request #63 from mglisse/doc-bottleneck
Citations for bottleneck distance
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