The following pages link to Omrit Filtser (Q1705646):
Displayed 19 items.
- Universal approximate simplification under the discrete Fréchet distance (Q1705647) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Efficient nearest-neighbor query and clustering of planar curves (Q2285081) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Approximate nearest neighbor for curves: simple, efficient, and deterministic (Q2701391) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- On the Chain Pair Simplification Problem (Q3449833) (← links)
- (Q4608597) (← links)
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4635562) (← links)
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4962190) (← links)
- (Q5075347) (← links)
- (Q5090454) (← links)
- (Q5116484) (← links)
- Algorithms for the discrete Fréchet distance under translation (Q5120149) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918894) (← links)
- A tour of general Hanoi graphs (Q6144016) (← links)
- (Q6147323) (← links)