1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CG2026★ 1 cited
Fine-Grained Complexity of Continuous Euclidean k-Center
Lotte Blank, Karl Bringmann, Parinya Chalermsook +4
In the (continuous) Euclidean -center problem, given points in and an integer , the goal is to find center points in that minimize the m…
cs.CG2026
Fréchet Distance in the Imbalanced Case
Lotte Blank
Given two polygonal curves and defined by and vertices with , we show that the discrete Fréchet distance in 1D cannot be approximated within a factor of $2…
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 sim…