Advertisement

Israel Journal of Mathematics

, Volume 182, Issue 1, pp 199–228 | Cite as

Lower bounds for weak epsilon-nets and stair-convexity

  • Boris Bukh
  • Jiří Matoušek
  • Gabriel Nivasch
Article

Abstract

A set N ⊂ ℝ d is called a weak ɛ-net (with respect to convex sets) for a finite X ⊂ ℝ d if N intersects every convex set C with |XC| ≥ ɛ|X|. For every fixed d ≥ 2 and every r ≥ 1 we construct sets X ⊂ ℝ d for which every weak 1/r -net has at least Ω(r logd−1 r) points; this is the first superlinear lower bound for weak ɛ-nets in a fixed dimension.

The construction is a stretched grid, i.e., the Cartesian product of d suitable fast-growing finite sequences, and convexity in this grid can be analyzed using stair-convexity, a new variant of the usual notion of convexity.

We also consider weak ɛ-nets for the diagonal of our stretched grid in ℝ d , d ≥ 3, which is an “intrinsically 1-dimensional” point set. In this case we exhibit slightly superlinear lower bounds (involving the inverse Ackermann function), showing that the upper bounds by Alon, Kaplan, Nivasch, Sharir and Smorodinsky (2008) are not far from the truth in the worst case.

Using the stretched grid we also improve the known upper bound for the so-called second selection lemma in the plane by a logarithmic factor: We obtain a set T of t triangles with vertices in an n-point set in the plane such that no point is contained in more than O(t 2/(n 3 logn 3/t)) triangles of T.

Keywords

Convex Hull Computational Geometry Vertical Projection Selection Lemma Strong Lower Bound 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N. Alon, A non-linear lower bound for planar epsilon-nets, in 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS’10), to appear; http://www.math.tau.ac.il/ nogaa/PDFS/epsnet3.pdf.
  2. [2]
    N. Alon, I. Bárány, Z. Füredi and D. J. Kleitman, Point selections and weak ɛ-nets for convex hulls, Combinatorics, Probability and Computing 1 (1992), 189–200.CrossRefzbMATHMathSciNetGoogle Scholar
  3. [3]
    N. Alon, G. Kalai, J. Matoušek and R. Meshulam, Transversal numbers for hypergraphs arising in geometry, Advances in Applied Mathematics 130 (2002), 2509–2514.Google Scholar
  4. [4]
    N. Alon, H. Kaplan, G. Nivasch, M. Sharir and S. Smorodinsky, Weak ɛ-nets and interval chains, Journal of the ACM 55, article 28, (2008), 32 pp.Google Scholar
  5. [5]
    N. Alon and D. Kleitman, Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem, Advances in Mathematics 96 (1992), 103–112.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [6]
    I. Bárány, Z. Füredi and L. Lovász, On the number of halving planes, Combinatorica 10 (1990), 175–183.CrossRefzbMATHMathSciNetGoogle Scholar
  7. [7]
    P. G. Bradford and V. Capoyleas, Weak ɛ-nets for points on a hypersphere, Discrete & Computational Geometry 18 (1997), 83–91.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [8]
    B. Bukh, J. Matoušek and G. Nivasch, Stabbing simplices by points and flats, Discrete & Computational Geometry 43 (2010), 321–338.CrossRefzbMATHMathSciNetGoogle Scholar
  9. [9]
    B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir and E. Welzl, Improved bounds on weak ɛ-nets for convex sets, Discrete & Computational Geometry 13 (1995), 1–15.CrossRefzbMATHMathSciNetGoogle Scholar
  10. [10]
    D. Eppstein, Improved bounds for intersecting triangles and halving planes, Journal of Combinatorial Theory. Series A 62 (1993), 176–182.CrossRefzbMATHMathSciNetGoogle Scholar
  11. [11]
    D. Haussler and E. Welzl, ɛ-nets and simplex range queries, Discrete & Computational Geometry 2 (1987), 127–151.CrossRefzbMATHMathSciNetGoogle Scholar
  12. [12]
    P. Kirchberger, Über Tchebychefsche Annäherungsmethoden, Mathematische Annalen 57 (1903), 509–540.CrossRefzbMATHMathSciNetGoogle Scholar
  13. [13]
    E. Magazanik and M. A. Perles, Staircase connected sets, Discrete & Computational Geometry 37 (2007), 587–599.CrossRefzbMATHMathSciNetGoogle Scholar
  14. [14]
    J. Matoušek, Geometric Discrepancy (An Illustrated Guide), Springer-Verlag, Berlin, 1999.zbMATHGoogle Scholar
  15. [15]
    J. Matoušek, Lectures on Discrete Geometry, Springer-Verlag, New York, 2002.zbMATHGoogle Scholar
  16. [16]
    J. Matoušek, A lower bound for weak ɛ-nets in high dimension, Discrete & Computational Geometry 28 (2002), 45–48.CrossRefzbMATHMathSciNetGoogle Scholar
  17. [17]
    J. Matoušek and U. Wagner, New constructions of weak ɛ-nets, Discrete & Computational Geometry 32 (2004), 195–206.zbMATHMathSciNetGoogle Scholar
  18. [18]
    G. Nivasch, Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations, Jornal of the ACM, article 17, (2010), 44 pp.Google Scholar
  19. [19]
    G. Nivasch, Weak Epsilon-Nets, Davenport-Schinzel Sequences, and Related Problems, Ph.D. thesis, Blavatnik School of Computer Science, Tel Aviv University, 2009.Google Scholar
  20. [20]
    G. Nivasch and M. Sharir, Eppstein’s bound on intersecting triangles revisited, Journal of Combinatorial Theory. Series A 116 (2009), 494–497.CrossRefzbMATHMathSciNetGoogle Scholar
  21. [21]
    K. F. Roth, On irregularities of distribution, Mathematika 1 (1954), 73–79.CrossRefzbMATHMathSciNetGoogle Scholar
  22. [22]
    M. L. G. van de Vel, Theory of Convex Structures, North-Holland, Amsterdam, 1993.zbMATHGoogle Scholar
  23. [23]
    R. T. Živaljević, Topological methods, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O’Rourke, eds.), Chapter 14, second edition, Chapman & Hall/CRC, Baca Raton, FL, 2004, pp. 305–329.Google Scholar

Copyright information

© Hebrew University Magnes Press 2011

Authors and Affiliations

  • Boris Bukh
    • 1
    • 2
  • Jiří Matoušek
    • 3
  • Gabriel Nivasch
    • 4
  1. 1.Centre for Mathematical SciencesCambridgeEngland
  2. 2.Churchill CollegeCambridgeEngland
  3. 3.Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI)Charles UniversityPraha 1Czech Republic
  4. 4.Institute of Theoretical Computer ScienceETH ZürichZürichSwitzerland

Personalised recommendations