Unit distance problems

Daniel Oberlin, Richard Oberlin

We study some discrete and continuous variants of the following
problem of Erdos: given a finite subset P of R^{2} or
R^{3}, what is the maximum number of pairs (p_{1},
p_{2}) with p_{1}, p_{2} in P and
|p_{1}-p_{2}| = 1 ?