1 citations · 1 across the 13 of their papers we have counts for
5 papers · 1 filter
How to Walk a Dog in Parallel: On Parallel Computation of the Discrete Frechet Distance
Leonid Barenboim, Arnold Filtser, Omrit Filtser +1
The Fréchet distance (also known as the dog-leash distance) is a well-studied and prevalent distance measure for polygonal curves. In this paper we present parallel algorithms for…
Segment Watchman Routes
Anna Brötzner, Omrit Filtser, Bengt J. Nilsson +2
Motivated by applications for robust guarding, we consider a variant of the multiple-watchmen problem that ensures that every point within a polygon is seen from more than one…
On Fréchet Traveling Salesmen Problems
Omrit Filtser, Tzalik Maimon, Michal Moiseev
The Fréchet distance is a well-studied distance measure between two curves. In this work, we demonstrate that the merit of Fréchet distance extends beyond evaluating similarity, an…
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan
The minimum convex cover problem seeks to cover a polygon with the fewest convex polygons that lie within . This problem is -complete, and the best previou…
Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
Tsuri Farhana, Omrit Filtser, Shalev Goldshtein
We study unlabeled MRMP for unit-disk robots in a polygonal environment. Although the problem is hard in general, polynomial-time solutions exist under appropriate separation assum…