22 citations · 24 across the 11 of their papers we have counts for
18 papers
Computing All Optimal Partial -Wasserstein Matchings on the Line
Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5
For , the -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…
Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
Lotte Blank, Jacobus Conradi, Anne Driemel +3
The Fréchet distance is a computational mainstay for comparing polygonal curves. The Fréchet distance under translation, which is a translation invariant version, considers the sim…
Faster Fréchet Distance under Transformations
Kevin Buchin, Maike Buchin, Zijin Huang +2
We study the problem of computing the Fréchet distance between two polygonal curves under transformations. First, we consider translations in the Euclidean plane. Given two curves…
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
Karl Bringmann, Kasper Green Larsen, André Nusser +2
Union volume estimation is a classical algorithmic problem. Given a family of objects , we want to approximate the volume of their union. In…
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
Ivor van der Hoog, André Nusser, Eva Rotenberg +1
A classical problem in computational geometry and graph algorithms is: given a dynamic set S of geometric shapes in the plane, efficiently maintain the connectivity of the intersec…
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann +2
The Dynamic Time Warping (DTW) distance is a popular measure of similarity for a variety of sequence data. For comparing polygonal curves in , it provides a ro…