1 citations · 1 across the 13 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CG2019
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
Stav Ashur, Omrit Filtser, Matthew J. Katz
The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time -approximation algorithm for placing as few g…
cs.CG2019
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Boris Aronov, Omrit Filtser, Michael Horton +2
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let be a set of polygonal curves,…
cs.CG2019
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic
Arnold Filtser, Omrit Filtser, Matthew J. Katz
In the -approximate near-neighbor problem for curves (ANNC) under some distance measure , the goal is to construct a data structure for a given set $\mathcal{…