diff options
| author | Marc Glisse <marc.glisse@inria.fr> | 2019-05-29 14:17:00 +0200 |
|---|---|---|
| committer | Marc Glisse <marc.glisse@inria.fr> | 2019-05-29 14:17:00 +0200 |
| commit | b9a6a203a71eed7f17de219070ca24e448b53b9e (patch) | |
| tree | 76a930e4ada82eb1a70a021b7f13d13319606438 /src | |
| parent | a227bc0be7c5ee70ff45f6ee06da9be0553b1937 (diff) | |
Citations for bottleneck distance
Diffstat (limited to 'src')
| -rw-r--r-- | src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 3 |
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 |