2N noncollinear points determine at least 2N directions
From MaRDI portal
Publication:1170240
DOI10.1016/0097-3165(82)90045-0zbMath0496.05001MaRDI QIDQ1170240
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(82)90045-0
Related Items
Variations on the Sum-Product Problem, 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 note on the minimum number of edge-directions of a convex polytope, Allowable interval sequences and separating convex sets in the plane, Semispaces of configurations, cell complexes of arrangements, The structure of sets with few sums along a graph, Suballowable sequences and geometric permutations, Few slopes without collinearity, The complexity of point configurations, A geometric condition for a hyperplane arrangement to be free, Counting \(k\)-projections of a point set, Direction trees, On the number of directions determined by a three-dimensional points set, Ordering points by linear functionals, On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane, New sum-product estimates for real and complex numbers, Valid orderings of real hyperplane arrangements, Graph drawings with few slopes, Logarithmic bundles and line arrangements, an approach via the standard construction
Cites Work
