Lines induced by bichromatic point sets
classification
🧮 math.CO
keywords
pointpointscollinearleastlinesplanebeckbichromatic
read the original abstract
An important theorem of Beck says that any point set in the Euclidean plane is either ``nearly general position'' or ``nearly collinear'': there is a constant C>0 such that, given n points in the plane with at most r$ of them collinear, the number of lines induced by the points is at least Cr(n-r). Recent work of Gutkin-Rams on billiards orbits requires the following elaboration of Beck's Theorem to bichromatic point sets: there is a constant C>0 such that, given n red points and n blue points in the plane with at most r of them collinear, the number of lines spanning at least one point of each color is at least Cr(2n-r).
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.