On the Sets of Directions Determined by n Points

DOI10.2307/2317384MaRDI QIDQ5587668zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(20)

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

This page was built for publication: On the Sets of Directions Determined by n Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5587668)