pith. sign in

arxiv: 0803.1088 · v1 · submitted 2008-03-07 · 🧮 math.CO

Depth of segments and circles through points enclosing many points: a note

classification 🧮 math.CO
keywords pointsalwayscircleknownleastpairresultthem
0
0 comments X
read the original abstract

Neumann-Lara and Urrutia showed in 1985 that in any set of n points in the plane in general positionthere is always a pair of points such that any circle through them contains at least (n-2)/60 points. In a series of papers, this result was subsequently improved till n/4.7, which is currently the best known lower bound. In this paper we propose a new approach to the problem that allows us, by using known results about j-facets of sets of points in $R^3$, to give a simple proof of a somehow stronger result: there is always a pair of points such that any circle through them has, both inside and outside, at least n/4.7 points.

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.