Radial points in the plane
type: Item
instance of: scholarly article
title: Radial points in the plane
zbMATH Open document ID: 0991.52003
author: János Pach
author: Micha Sharir
published in: European Journal of Combinatorics
publication date: 2002-08-21T00:00:00Z
reviewed by: C. Peri
Mathematics Subject Classification ID: 52C10
Mathematics Subject Classification ID: 51A25
Mathematics Subject Classification ID: 52C35
zbMATH DE Number: 1659319
zbMATH Keywords: radial points
zbMATH Keywords: quasiradial points
zbMATH Keywords: incidence structure
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2065117339
cites work: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Q4263468
cites work: Q4339095
cites work: Graphs drawn with few crossings per edge
cites work: Distinct distances in the plane
cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry
cites work: Extremal problems in discrete geometry
cites work: A combinatorial distinction between the Euclidean and projective planes
DOI: 10.1006/EUJC.2001.0506
review text: 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\). NEWLINENEWLINENEWLINEThe 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)]. NEWLINENEWLINENEWLINEThe 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. NEWLINENEWLINENEWLINESeveral extensions of this result related to the incidence structure between points and lines are also presented.
Recommended article: Discrete and Computational Geometry
Recommended article: Q5173161
Recommended article: On the Number of Radial Orderings of Colored Planar Point Sets
Recommended article: Extremal problems in discrete geometry
Recommended article: Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)
description: scientific article; zbMATH DE number 1659319