Small-size ε-nets for axis-parallel rectangles and boxes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 639-648

  Aronov, Boris ^a   Ezra, Esther ^b   Sharir, Micha ^c,d  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Duke University   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

E nets; Geometric range spaces; Hitting set; Randomized algorithms; Set cover

Indexed keywords

E-NETS; GEOMETRIC RANGE SPACES; HITTING SET; RANDOMIZED ALGORITHMS; SET COVER;

COMPUTATION THEORY; GEOMETRY; POLYNOMIAL APPROXIMATION;

SET THEORY;

EID: 70350668803     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536501     Document Type: Conference Paper

References (38)

1. P. K. Agarwal, J. Matoušek, and O. Schwarzkopf, Computing many faces in arrangements of lines and segments, SIAM J. Comput., 27:491-505, 1998.
2. M. Bellare, S. Goldwasser, G. Lund, and A. Russell, Efficient probabilistically checkable proofs and applications to approximation. In Proc. 25th Annu. ACM Symp. Theory Comput., pp. 294-304, 1993.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension, J. ACM, 36(4):929-965, 1989.
4. J.D. Boissonnat, M. Sharir, B. Tagansky and M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, Discrete Comput. Geom., 19:485-519, 1998.
5. H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC dimensions, Discrete Comput. Geom., 14:463-479, 1995.
6. H. Brönnimann and J. Lenchner, Fast almost-linear-sized nets for boxes in the plane. In Proc. 14th Annu. Fall Workshop Comput. Geom., pp. 36-38, 2004.
7. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorica, 10:229-249, 1990.
8. K. L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom., 2:195-222, 1987.
9. K. L. Clarkson, Algorithms for polytope covering and approximation. In Proc. 3rd Workshop on Algorithms and Data Structures, pages 246-252, 1993.
10. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4:387-421, 1989.
11. K. L. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover, Discrete Comput. Geom., 37:43-58, 2007.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2001.
13. M. de Berg, Improved bounds on the union complexity of fat objects, Discrete Comput. Geom., 40(1):127-140, 2008.
14. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 3rd rev. ed., Springer-Verlag, Berlin, 2008.
15. A. Efrat, The complexity of the union of (α, β)-covered objects, SIAM J. Comput., 34:775-787, 2005.
16. H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, On arrangements of Jordan arcs with three intersections per pair, Discrete Comput. Geom., 4(1):523-539, 1989.
17. A. Efrat and M. Katz, On the union of k-curved objects, Comput. Geom. Theory Appl. 14:241-254, 1999.
18. A. Efrat and M. Sharir, The complexity of the unionof fat objects in the plane, Discrete Comput. Geom. 23:171-189, 2000.
19. T. Feder and D. H. Greene, Optimal algorithms for approximate clustering. In Proc. 20th Annu. ACM Symp. Theory Comput., pages 434-444, 1988.
20. U. Feige, A threshold of ln n for approximating set cover, J. ACM, 45(4):634-652, 1998.
21. R. Fowler, M. Paterson, and S. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett., 12(3):133-137, 1981.
22. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, 1979.
23. S. Har-Peled, H. Kaplan, M. Sharir, and S. Smorodinsky, ε-nets for halfspaces revisited, manuscript, 2008.
24. D. Haussler and E. Welzl, ε-nets and simplex range queries, Discrete Comput. Geom., 2:127-151, 1987.
25. H. Kaplan, N. Rubin, M. Sharir, and E. Verbin, Efficient colored orthogonal range counting, SIAM J. Comput., 38:982-1011, 2008.
26. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller, J. W. Thatcher, Eds., Complexity of Computer Computations, pages 85-103, Plenum Press, New York, 1972.
27. J. Komlós, J. Pach, and G. Woeginger, Almost tight bounds for epsilon nets, Discrete Comput. Geom., 7:163-173, 1992.
28. J. Matoušek, Lectures on Discrete Geometry, Springer-Verlag New York, 2002.
29. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl. 2:169-186, 1992.
30. J. Matoušek, Approximations and optimal geometric divide-and-conquer, J. Comput Sys. Sci., 50(2):203-208, 1995.
31. 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., pages 16-22, 1990. Revised version at http://kam.mff.cuni.cz/̃matousek/enets3.ps.gz .
32. J. Matoušek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput., 23:154-169, 1994.
33. A. Naamad, D. T. Lee, and W. L. Hsu, On the maximal empty rectangle problem, Discrete Applied Math., 8:267-277, 1984.
34. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley Interscience, New York, 1995.
35. J. Pach and G. Tardos, On the boundary complexity of the union of fat triangles, SIAM J. Comput., 31:1745-1760, 2002.
36. E. Pyrga and S. Ray, New existence proofs for ε-nets. In Proc. 24th Annu. ACM Sympos. Comput. Geom., pages 199-207, 2008.
37. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
38. K. Varadarajan, Epsilon nets and union complexity. In Proc. 25th Annu. ACM Sympos. Comput. Geom., 2009, to appear.