#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2000

2018

- This year (2)
- Last 5 years (14)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We show the existence of ε-nets of size O ( 1 ε log log 1 ε ) for planar point sets and axisparallel rectangular ranges. The same bound holds for points in the plane and “fat” triangular ranges and… (More)

- Esther Ezra, Micha Sharir, Alon Efrat
- Symposium on Computational Geometry
- 2006

We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as a successful… (More)

- Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Esther Ezra
- ACM Journal of Experimental Algorithmics
- 2000

Planar maps are fundamental structures in computational geometry. They are used to represent the subdivision of the plane into regions and have numerous applications. We describe the planar map… (More)

- Nir Ailon, Ron Begleiter, Esther Ezra
- COLT
- 2012

The disagreement coefficient of Hanneke has become a central concept in proving active learning rates. It has been shown in various ways that a concept class with low complexity together with a bound… (More)

- Pankaj K. Agarwal, Esther Ezra, Micha Sharir
- Symposium on Computational Geometry
- 2009

Given a set system (X,R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H. We present near-linear… (More)

We study the problem of covering a two-dimensional spatial r egionP , cluttered with occluders, by sensors. A sensor placed at a lo cationp coversa point x in P if x lies within sensing radius r from… (More)

- Esther Ezra
- Inf. Process. Lett.
- 2010

- Esther Ezra, Shachar Lovett
- APPROX-RANDOM
- 2015

Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,Σ), where each element x ∈ X lies in t randomly selected sets… (More)

- Esther Ezra
- Symposium on Computational Geometry
- 2005

We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of <i>k</i> convex polyhedra in 3-space having <i>n</i> facets in total. We use a variant of the… (More)

- Esther Ezra, Boris Aronov, Micha Sharir
- SODA
- 2011

We show that, for any fixed Δ > 0, the combinatorial complexity of the union of <i>n</i> triangles in the plane, each of whose angles is at least Δ, is <i>O</i>(<i>n</i>2<sup>α(<i>n</i>)</sup> log*… (More)