Eppstein's bound on intersecting triangles revisited

Gabriel Nivasch, Micha Sharir

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Ω (m3 / (n6 log2 n)) triangles of T. Eppstein [D. Eppstein, Improved bounds for intersecting triangles and halving planes, J. Combin. Theory Ser. A 62 (1993) 176-182] gave a proof of this claim, but there is a problem with his proof. Here we provide a correct proof by slightly modifying Eppstein's argument.

Original languageEnglish
Pages (from-to)494-497
Number of pages4
JournalJournal of Combinatorial Theory. Series A
Volume116
Issue number2
DOIs
StatePublished - Feb 2009
Externally publishedYes

Keywords

  • Selection Lemma
  • Simplex
  • Triangle
  • k-set

Fingerprint

Dive into the research topics of 'Eppstein's bound on intersecting triangles revisited'. Together they form a unique fingerprint.

Cite this