31 citations · 116 across the 24 of their papers we have counts for
Showing 2020 · cs.CGShow all
3 papers · 2 filters
cs.CG2020
Approximating -Median Clustering for Polygonal Curves
Maike Buchin, Anne Driemel, Dennis Rohde
In 2015, Driemel, Krivošija and Sohler introduced the -median problem for clustering polygonal curves under the Fréchet distance. Given a set of input curves, the problem…
cs.CG2020★ 2 cited
Computing the Fréchet distance of trees and graphs of bounded tree width
Maike Buchin, Amer Krivošija, Alexander Neuhaus
We give algorithms to compute the Fréchet distance of trees and graphs with bounded tree width. Our algorithms run in time for trees of bounded degree, and $O(n^2\sqrt{n \…
cs.CG2020★ 2 cited
On the complexity of the middle curve problem
Maike Buchin, Nicole Funk, Amer Krivošija
For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the com…