Author:
Alon Noga,Bárány Imre,Füredi Zoltán,Kleitman Daniel J.
Abstract
One of our results: let X be a finite set on the plane, 0 < ε < 1, then there exists a set F (a weak ε-net) of size at most 7/ε2 such that every convex set containing at least ε|X| elements of X intersects F. Note that the size of F is independent of the size of X.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference19 articles.
1. [17] Welzl E. (1990) Lecture at a DIMACS conference, January 1990.
2. On the number of halving lines;Lováasz;Annales Univ Sci Budapest,1971
3. Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem.;Alon;Adv. Math.
4. On empty triangles determined by points in the plane
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献