summaryrefslogtreecommitdiff
path: root/README.txt
blob: ae3f6a0e53eee01336df4caeb31a62ee70691c9a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
This repository contains software to compute bottleneck and Wasserstein
distances between persistence diagrams.

The software is licensed under
BSD license, see license.txt file.
If you are going to use this software for research purposes,
you probably do not need to worry about that.

See README files in subdirectories for usage and building.

If you use Hera in your project, we would appreciate if you
cite the corresponding paper: 
Michael Kerber, Dmitriy Morozov, and Arnur Nigmetov,
"Geometry Helps to Compare Persistence Diagrams.", 
Journal of Experimental Algorithmics, vol. 22, 2017, pp. 1--20.
(conference version: ALENEX 2016).
The BibTeX is below:


@article{jea_hera,
  title={Geometry helps to compare persistence diagrams},
  author={Kerber, Michael and Morozov, Dmitriy and Nigmetov, Arnur},
  journal={Journal of Experimental Algorithmics (JEA)},
  volume={22},
  pages={1--20},
  year={2017},
  publisher={ACM New York, NY, USA}
}