diff options
| author | Vincent Rouvreau <VincentRouvreau@users.noreply.github.com> | 2019-06-03 15:34:36 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-06-03 15:34:36 +0200 |
| commit | 7705d6ceac3d8a302b1950f77565f44a15122a30 (patch) | |
| tree | 76a930e4ada82eb1a70a021b7f13d13319606438 | |
| parent | a227bc0be7c5ee70ff45f6ee06da9be0553b1937 (diff) | |
| parent | b9a6a203a71eed7f17de219070ca24e448b53b9e (diff) | |
Merge pull request #63 from mglisse/doc-bottleneck
Citations for bottleneck distance
| -rw-r--r-- | biblio/bibliography.bib | 22 | ||||
| -rw-r--r-- | src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 3 |
2 files changed, 24 insertions, 1 deletions
diff --git a/biblio/bibliography.bib b/biblio/bibliography.bib index be4c2db5..288692b2 100644 --- a/biblio/bibliography.bib +++ b/biblio/bibliography.bib @@ -1139,4 +1139,24 @@ language={English} timestamp = {Mon, 13 Aug 2018 16:46:26 +0200}, biburl = {https://dblp.org/rec/bib/journals/corr/BoissonnatS16}, bibsource = {dblp computer science bibliography, https://dblp.org} -}
\ No newline at end of file +} + +@article{Kerber:2017:GHC:3047249.3064175, + author = {Kerber, Michael and Morozov, Dmitriy and Nigmetov, Arnur}, + title = {Geometry Helps to Compare Persistence Diagrams}, + journal = {J. Exp. Algorithmics}, + issue_date = {2017}, + volume = {22}, + month = sep, + year = {2017}, + issn = {1084-6654}, + pages = {1.4:1--1.4:20}, + articleno = {1.4}, + numpages = {20}, + url = {http://doi.acm.org/10.1145/3064175}, + doi = {10.1145/3064175}, + acmid = {3064175}, + publisher = {ACM}, + address = {New York, NY, USA}, + keywords = {Assignment problems, bipartite matching, k-d tree, persistent homology}, +} 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 |