Results 1 -
1 of
1
The number of different distances determined by n points in the plane
- J. Combin. Theory Ser. A
, 1984
"... 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 thatf(n)> n”‘/(2 fi)- 1 and this has remained for 30 years as the best lower bound known for f(n). It is shown t ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
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 thatf(n)> n”‘/(2 fi)- 1 and this has remained for 30 years as the best lower bound known for f(n). It is shown that f(n)> cn “ ’ for some fixed constant c. I.
