On the Sets of Directions Determined by n Points

DOI10.2307/2317384zbMath0192.57603OpenAlexW4240860452MaRDI QIDQ5587668

Paul R. Scott

Publication date: 1970

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2317384

zbMATH Keywords

elementary geometry

Related Items

Few slopes without collinearity ⋮ On the number of directions determined by a three-dimensional points set ⋮ Graph drawings with few slopes ⋮ The structure of sets with few sums along a graph ⋮ A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane ⋮ Geometria combinatoria e geometrie finite ⋮ Some combinatorial problems in the plane ⋮ Ungarian Markov chains ⋮ On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points ⋮ Unnamed Item ⋮ 2N noncollinear points determine at least 2N directions ⋮ Unnamed Item ⋮ The complexity of point configurations ⋮ On supersolvable and nearly supersolvable line arrangements ⋮ On the geometry of real or complex supersolvable line arrangements ⋮ On the sets of \(n\) points forming \(n+1\) directions ⋮ Direction trees ⋮ The directions determined by n points in the plane: A matroidal generalization ⋮ On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane