Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
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…
cs.CG2026
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…