3 papers
cs.CG2025
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…
cs.CG2025
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 s…
cs.CG2025
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…