Radial points in the plane
Let \(P\) be a set of \(n\) non-collinear points in the plane. A point \(q\notin P\) is called radial point for \(P\) if every line joining \(q\) to a point in \(P\) contains at least two points of \(P\). The authors prove that any set of \(n\) non-collinear points in the plane has at most \(O(n)\) radial points, confirming a conjecture due to \textit{R. Pinchasi} [On the size of a directed set of a set of points in the plane (Preprint, Hebrew University, Jerusalem) (1999)]. The main idea of the proof is the following. Any radial point \(q\) is proved to have an ``index \(j\) such that the number of lines through \(q\) which contain at least \(j\) points of \(P\) is at least \(n\over(6j\ln ^{2}j)\). The number of radial points with a small index is then shown to be linear and a linear bound for the number of radial points with a large index is likewise derived. Several extensions of this result related to the incidence structure between points and lines are also presented.
- A combinatorial distinction between the Euclidean and projective planes
- Combinatorial complexity bounds for arrangements of curves and spheres
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Distinct distances in the plane
- Extremal problems in discrete geometry
- Graphs drawn with few crossings per edge
- scientific article; zbMATH DE number 1341906 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
This page was built for publication: Radial points in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946643)
