M. Buchin

activity

20072026

most citedMemory-Constrained Algorithms for Simple Polygons

31 citations · 116 across the 24 of their papers we have counts for

collaborators

Showing 2021 · cs.CGShow all

3 papers · 2 filters

cs.CG2021

Approximating Length-Restricted Means under Dynamic Time Warping

Maike Buchin, Anne Driemel, Koen van Greevenbroek +2

We study variants of the mean problem under the $p$ -Dynamic Time Warping ( $p$ -DTW) distance, a popular and robust distance measure for sequential data. In our setting we are given…

cs.CG2021

Coresets for $(k, ℓ)$ -Median Clustering under the Fréchet Distance

Maike Buchin, Dennis Rohde

We present an algorithm for computing $ε$ -coresets for $(k, ℓ)$ -median clustering of polygonal curves in $R^{d}$ under the Fréchet distance. This type of clustering is an…

cs.CG2021

Decomposing Polygons into Fat Components

Maike Buchin, Leonie Selbach

We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $α$ -fat, which means that the aspect ratio of each subpolygon is at most $α$ .…

Approximating Length-Restricted Means under Dynamic Time Warping

Coresets for (k,ℓ)-Median Clustering under the Fréchet Distance

Decomposing Polygons into Fat Components

Coresets for $(k, ℓ)$ -Median Clustering under the Fréchet Distance