Benjamin Raichel

activity

20112026

most citedFast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

11 citations · 49 across the 23 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CG2024

The Fréchet Distance Unleashed: Approximating a Dog with a Frog

Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson

We show that a variant of the continuous Frechet distance between polygonal curves can be computed using essentially the same algorithm used to solve the discrete version. The new…

cs.CG2024

Fréchet Edit Distance

Emily Fox, Amir Nayyeri, Jonathan James Perry +1

We define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ > 0$ , we seek the minimum number of edits to $σ$ such th…