Bug#961784: ITP: hera -- Library for computing bottleneck and Wasserstein distances between persistence diagrams

[Gard Spreemann <gspr@nonempty.org>]

Package: wnpp
Severity: wishlist
Owner: Gard Spreemann <gspr@nonempty.org>

* Package name    : hera
  Version         : 0~git20200309
  Upstream Author : Arnur Nigmetov
* URL             : https://github.com/grey-narn/hera
* License         : BSD-3-clause
  Programming Lang: C++
  Description     : Library for computing bottleneck and Wasserstein distances between persistence diagrams

Hera is a header-only library that implements algorithms from

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).

that exploits geometry to compute Wasserstein and bottleneck distances
between persistence diagrams much faster than plain matching-based
algorithms.

The library is being packaged because it is now an upstream dependency
of GUDHI (src:gudhi).

I intend to maintain the package myself.