activity
20122026
most citedFour Soviets Walk the Dog-Improved Bounds for Computing the Fréchet Distance

30 citations · 104 across the 28 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.CG2013★ 5 cited

Map Matching with Simplicity Constraints

Wouter Meulemans

We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fréchet distance is a common measure for this pr…

cs.CG2013★ 12 cited

Computing the Fréchet Distance with a Retractable Leash

Kevin Buchin, Maike Buchin, Rolf van Leusden +2

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle…