The number of different distances determined by n points in the plane
FRK Chung - Journal of Combinatorial Theory, Series A, 1984 - Elsevier
Journal of Combinatorial Theory, Series A, 1984•Elsevier
A classical problem in combinatorial geometry is that of determining the minimum number f
(n) of different distances determined by n points in the Euclidean plane. In 1952, L. Moser
proved that f (n)> n 2 3 (2) 9 3 and this has remained for 30 years as the best lower bound
known for f (n). It is shown that f (n)> cn 5 7 for some fixed constant c.
(n) of different distances determined by n points in the Euclidean plane. In 1952, L. Moser
proved that f (n)> n 2 3 (2) 9 3 and this has remained for 30 years as the best lower bound
known for f (n). It is shown that f (n)> cn 5 7 for some fixed constant c.
A classical problem in combinatorial geometry is that of determining the minimum number f (n) of different distances determined by n points in the Euclidean plane. In 1952, L. Moser proved that f (n)> n 2 3 (2) 9 3 and this has remained for 30 years as the best lower bound known for f (n). It is shown that f (n)> cn 5 7 for some fixed constant c.
Elsevier
Showing the best result for this search. See all results