Thijs van der Horst

collaborators

2 papers

cs.CG2025

Computing the Fréchet Distance When Just One Curve is $c$ -Packed: A Simple Almost-Tight Algorithm

Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst +1

We study approximating the continuous Fréchet distance of two curves with complexity $n$ and $m$ , under the assumption that only one of the two curves is $c$ -packed. Driemel, Har{-…

cs.CG2025

A near-linear time exact algorithm for the $L_{1}$ -geodesic Fréchet distance between two curves on the boundary of a simple polygon

Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1

Let $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$ , with $n$ and $m$ vertices. We show how to compute the Fréche…

Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm

A near-linear time exact algorithm for the L1​-geodesic Fréchet distance between two curves on the boundary of a simple polygon

Computing the Fréchet Distance When Just One Curve is $c$ -Packed: A Simple Almost-Tight Algorithm

A near-linear time exact algorithm for the $L_{1}$ -geodesic Fréchet distance between two curves on the boundary of a simple polygon