On the number of directions determined by a three-dimensional points set

DOI10.1016/j.jcta.2004.04.010zbMath1055.52013OpenAlexW2140790381MaRDI QIDQ1881677

Rom Pinchasi, János Pach, Micha Sharir

Publication date: 14 October 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.04.010

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items

Graph drawings with few slopes, Blocking visibility for points in general position, On sets of directions determined by subsets of \(\mathbb R^d\), A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane, On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space, On the sets of \(n\) points forming \(n+1\) directions, The maximum number of edges in geometric graphs with pairwise virtually avoiding edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• Some combinatorial problems in the plane
• 2N noncollinear points determine at least 2N directions
• The directions determined by n points in the plane: A matroidal generalization
• The number of directions determined by points in the three-dimensional Euclidean space
• A survey of Sylvester's problem and its generalizations
• On the Sets of Directions Determined by n Points
• Sylvester's Problem on Collinear Points and a Relative
• Proofs from THE BOOK