Small Strong Epsilon Nets
Abstract
Let P be a set of n points in . A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than points of P. We call a point x a strong centerpoint for a family of objects if is contained in every object that contains more than a constant fraction of points of P. A strong centerpoint does not exist even for halfspaces in . We prove that a strong centerpoint exists for axis-parallel boxes in and give exact bounds. We then extend this to small strong -nets in the plane and prove upper and lower bounds for where is the family of axis-parallel rectangles, halfspaces and disks. Here represents the smallest real number in such that there exists an -net of size i with respect to .
Cite
@article{arxiv.1208.2785,
title = {Small Strong Epsilon Nets},
author = {Pradeesha Ashok and Umair Azmi and Sathish Govindarajan},
journal= {arXiv preprint arXiv:1208.2785},
year = {2012}
}
Comments
19 pages, 12 figures