120 citations · 472 across the 33 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CG2019★ 8 cited
Efficient Approximation of the Matching Distance for 2-parameter persistence
Michael Kerber, Arnur Nigmetov
The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matchi…
cs.CG2019
Topology-Preserving Terrain Simplification
Ulderico Fugacci, Michael Kerber, Hugo Manet
We give necessary and sufficient criteria for elementary operations in a two-dimensional terrain to preserve the persistent homology induced by the height function. These operation…
cs.CG2019
Metric Spaces with Expensive Distances
Michael Kerber, Arnur Nigmetov
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in te…