שחר סמורודינסקי

Given a set P of points in the plane, a set of points Q is a weak -net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing |P| points contains a point of Q. In this paper, we determine bounds on iS, the smallest epsilon that can be guaranteed for any P when |Q|=i, for small values of i.