skip to main content
10.1145/1810959.1811017acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
research-article

Improving the first selection lemma in R3

Published:13 June 2010Publication History

ABSTRACT

We present new bounds on the first selection lemma in ℜ3. This makes progress on the open problems of Bukh, Matouaek and Nivash [6] and Boros-Füredi [4] for the three-dimensional case, improving the previously best result of Wagner [8]. While our results narrow the gap between the current best lower and upper bounds, they do not settle this question. However, they indicate that it is the current lower-bounds that are not tight, and we conjecture that the lower-bounds can be further improved to match the current upper bound.

References

  1. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman. Point selections and weak e-nets for convex hulls. Combinatorics, Probability & Computing, 1:189--200, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  2. N. Alon and D. Kleitman. Piercing convex sets and the hadwiger debrunner (p, q)-problem. Adv. Math., 96(1):103--112, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  3. I. Barany. A generalization of caratheodory's theorem. Discrete Math., 40:189--200, 1982.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. Boros and Z. Furedi. The number of triangles covering the center of an n-set. Geometriae Dedicata, 17(1):69--77, 1984.Google ScholarGoogle ScholarCross RefCross Ref
  5. B. Bukh. A point in many triangles. Electronic Journal of Combinatorics, 13(10), 2006.Google ScholarGoogle Scholar
  6. B. Bukh, M. Matousek, and G. Nivasch. Stabbing simplices by points and flats. http://arxiv.org/abs/0804.4464, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Matousek. Lectures in Discrete Geometry. Springer-Verlag, New York, NY, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. U. Wagner. On k-Sets and Applications. PhD thesis, ETH Zurich, 2003.Google ScholarGoogle Scholar

Index Terms

  1. Improving the first selection lemma in R3

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SoCG '10: Proceedings of the twenty-sixth annual symposium on Computational geometry
      June 2010
      452 pages
      ISBN:9781450300162
      DOI:10.1145/1810959

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 13 June 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate625of1,685submissions,37%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader