Lotte Blank

activity

20242026

most citedFine-Grained Complexity of Continuous Euclidean k-Center

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.CG2026

The Quick Dog Jumps the Log

Lotte Blank, Anne Driemel, Sariel Har-Peled +1

We give linear-time, and thus optimal, $(1 + ε)$ -approximation algorithms for numerous variants of the Frechet distance between $c$ -packed curves (where $c \in O (1)$ ), remo…

cs.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…

cs.CG2026

Fréchet Distance in the Imbalanced Case

Lotte Blank

Given two polygonal curves $P$ and $Q$ defined by $n$ and $m$ vertices with $m \leq n$ , we show that the discrete Fréchet distance in 1D cannot be approximated within a factor of $2…