pith. machine review for the scientific record. sign in

arxiv: 0804.4415 · v2 · submitted 2008-04-28 · 💻 cs.CG

Recognition: unknown

Eppstein's bound on intersecting triangles revisited

Authors on Pith no claims yet
classification 💻 cs.CG
keywords eppsteinprooftrianglesplanethereargumentboundclaim
0
0 comments X
read the original 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 Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.