New existence proofs for ε-nets

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 199-207

  Pyrga, Evangelia ^a   Ray, Saurabh ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Discrete geometry; Hitting sets; Hypergraph transversals; Strong nets

Indexed keywords

GRAPH THEORY; MARINE BIOLOGY; TOPOLOGY;

DISCRETE GEOMETRY; HALF SPACES; HITTING SETS; HYPER GRAPHS; HYPEREDGES; HYPERGRAPH TRANSVERSALS; NEW TECHNIQUES; UPPER BOUNDS; VC DIMENSIONS; VERTEX SETS;

COMPUTATIONAL GEOMETRY;

EID: 57349089195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377708     Document Type: Conference Paper

References (23)

1. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, and Shakhar Smorodinsky, Lenses in arrangements of pseudo-circles and their applications. J. ACM, 51(2):139-186, 2004.
2. Pankaj K. Agarwal, János Pach, and Micha Sharir. State of the union, of geometric objects: A review, manuscript, 2007.
3. Pankaj K. Agarwal and Micha Sharir. Pseudo-line arrangements: duality, algorithms, and applications. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 800-809, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
4. Martin Anthony and Norman L. Biggs. Computational Learning Theory: An Introduction. Cambridge University Press, UK, 1992.
5. Kenneth Appel and Wolfgang Haken. Every planar map is four colorable. Journal of Mathematics, 21:108-121, 1977.
6. Claude Berge. Hypergraphs. page 256, 1989.
7. Hervé Bronnimann and Michael T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry, 14(4):463-479, 1995.
8. Marek Chrobak and David Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Set., 86(2):243-266, 1991.
9. Kenneth L. Clarkson. Randomized geometric algorithms. Computers and Euclidean Geometry, 1992.
10. Kenneth L. Clarkson and Kasturi Varadarajan. Improved approximation algorithms for geometric set cover. Discrete & Computational Geometry, 37(l):43-58, 2007.
11. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational geometry: algorithms and applications. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1997.
12. David Haussler and Emo Welzl. ε-nets and simplex range queries. Discrete & Computational Geometry, 2:127-151, 1987.
13. János Komlós, Janos Pach, and Gerhard J. Woeginger. Almost tight bounds for e-nets. Discrete & Computational Geometry, 7:163-173, 1992.
14. 3. In Susanne Albers and Pascal Weil, editors, 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Dagstuhl, Germany, 2008. Internationales Begegnungs-und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany.
15. Jirí Matousek. Reporting points in halfspaces. Comput. Geom., 2:169-186, 1992.
16. Jirí Matousek. Epsilon-nets and computational geometry. New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, 10:69-89, 1993.
17. Jirí Matousek. Lectures in Discrete Geometry. Springer-Verlag, New York, NY, 2002.
18. Jirí Matousek, Raimund Seidel, and Emo Welz. How to net a lot with little: Small ε-nets for disks and halfspaces. In Symposium on Computational Geometry, pages 16-22, 1990.
19. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
20. Ketan Mulmuley. Computational Geometry: An Introduction through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.
21. János Pach and Gerhard J. Woeginger. Some new bounds for epsilon-nets. In Symposium on Computational Geometry, pages 10-15, 1990.
22. Shakhar Smorodinsky. On the chromatic number of some geometric hypergraphs. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 316-323, New York, NY, USA, 2006. ACM.
23. Vladimir N. Vapnik and Alexey Ya. Chervonenkis. On the uniform convergence of relative frequencies to their probabilities. Theory Probab. AppL, 16(2):264-280, 1971.