Tight lower bounds for the size of epsilon-nets

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 458-463

  Pach, János ^a,b   Tardos, Gábor ^b,c  

^a EPFL   (Switzerland)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Theory

Indexed keywords

AXIS PARALLEL RECTANGLES; EUCLIDEAN SPACES; GEOMETRIC OBJECTS; INVERSE ACKERMANN FUNCTION; LOWER BOUNDS; PROBABILISTIC TECHNIQUE; RANGE SPACES; SUPERLINEAR; THEORY; VC-DIMENSION;

COMPUTATIONAL GEOMETRY;

EID: 79960184328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998271     Document Type: Conference Paper

References (29)

1. N. Alon, A non-linear lower bound for planar epsilon-nets, in: Proc. 51st Annu. IEEE Sympos. Found. Comput. Sci. (FOCS'10), 2010, 341-346. Also: Discrete Comput. Geom., to appear.
2. B. Aronov, E. Ezra and M. Sharir, Small-size epsilon-nets for axis-parallel rectangles and boxes, SIAM J. Comput. 39 (2010), 3248-3282.
3. B. Aronov, E. Ezra and M. Sharir, Improved bound for the union of fat triangles, in: Proc. 22nd Ann. ACM-SIAM Sympos. on Discrete Algorithms (SODA 2011), SIAM, Philadelphia, 2011, 1778-1785.
4. H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimensions, Discrete Comput. Geom. 14 (1995), 463-479.
5. B. Bukh, J. Matoušek and G. Nivasch, Lower bounds for weak epsilon-nets and stair-convexity, in: Proc. 25th ACM Sympos. Comput. Geom. (SoCG 2009), 2009, 1-10.
6. B. Chazelle, The Discrepancy Method, Cambridge University Press, Cambridge, 2000.
7. X. Chen, J. Pach, M. Szegedy, and G. Tardos: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles, Random Structures and Algorithms 34 (2009), 11-23.
8. K. L. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover, Discrete Comput. Geom. 37 (2007), 43-58.
9. G. Even, D. Rawitz and S. Shahar, Hitting sets when the VC-dimension is small, Inf. Process. Lett. 95 (2005), 358-362. (Pubitemid 40822822)
10. E. Ezra, A note about weak ε-nets for axis-parallel boxes in d-space, Information Processing Letters 110 (2010), 835-840.
11. H. Furstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem for k = 3, in: Graph Theory and Combinatorics (Cambridge, 1988), Discrete Math. 75 (1989), 227-241.
12. H. Furstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem, J. Anal. Math. 57 (1991), 64-119.
13. M. Gibson and K. R. Varadarajan, Decomposing coverings and the planar sensor cover problem, in: Proc. 5oth Ann. IEEE Symp. on Foundations of Computer Science (FOCS 2009), IEEE Comp. Soc., 2009, 159-168.
14. A. W. Hales and R. I. Jewett, Regularity and positional games, Trans. Amer. Math. Soc. 106 (1963), 222-229.
15. D. Haussler and E.Welzl, ε-nets and simplex range queries, Discrete Comput. Geom. 2 (1987), 127-151.
16. H. Kaplan, N. Rubin, M. Sharir, and E. Verbin, Efficient colored orthogonal range counting, SIAM J. Comput. 38 (2008), 982-1011.
17. J. Koml?os, J. Pach, and G. Woeginger, Almost tight bounds for epsilon nets, Discrete Comput. Geom. 7 (1992), 163-173.
18. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl. 2 (1992), 169-186.
19. J. Matoušek, R. Seidel and E. Welzl, How to net a lot with little: Small ε-nets for disks and halfspaces, In: Proc. 6th Annu. ACM Sympos. Comput. Geom., 1990, 16-22. (Pubitemid 20728474)
20. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley and Sons, Inc., New York, 1995.
21. J. Pach and G. Tardos, Coloring axis-parallel rectangles, J. Combin. Theory Ser. A 117 (2010), 776-782.
22. J. Pach, G. Tardos and G. Tó th, Indecomposable coverings, Canad. Math. Bull. 52 (2009), no. 3, 451-463.
23. J. Pach and G. Woeginger, Some new bounds for ε-nets, in: Proc. 6th Ann. Symp. on Computat. Geom., ACM Press, New York, 1990, 10-15.
24. D. H. J. Polymath, A new proof of the density Hales-Jewett theorem, preprint, available at arxiv.org/abs/0910.3926.
25. D. H. J. Polymath, Density Hales-Jewett and Moser numbers, preprint, available at arXiv:1002.0374.
26. E. Pyrga and S. Ray, New existence proofs for ε-nets, in: Proc. 24th Annu. ACM Sympos. Comput. Geom., 2008, 199-207.
27. K. Radziszewski, Sur une problème extré mal relative aux figures inscrites et circonscrites aux figures convexes, Ann. Univ. Mariae Curie-Sklodowska, Sect. A6, 1952, 5-18.
28. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
29. K. R. Varadarajan, Epsilon nets and union complexity, in: Proc. 25th Ann. ACM Sympos. Comput. Geom., 2009, 11-16.