Incidences in three dimensions and distinct distances in the plane

György Elekes*, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set S of s points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in three dimensions. We offer conjectures involving the new set-up, but are still unable to fully resolve them. Instead, we adapt the recent new algebraic analysis technique of Guth and Katz [9], as further developed by Elekes, Kaplan and Sharir [6], to obtain sharp bounds on the number of incidences between these helices or parabolas and points in ℝ3. Applying these bounds, we obtain, among several other results, the upper bound O(s3) on the number of rotations (rigid motions) which map (at least) three points of S to three other points of S. In fact, we show that the number of such rotations which map at least k ≥ 3 points of S to k other points of S is close to O(s3/k12/7). One of our unresolved conjectures is that this number is O(s3/k2), for k ≥ 2. If true, it would imply the lower bound Ω(s/logs) on the number of distinct distances in the plane.

Original languageEnglish
Pages (from-to)571-608
Number of pages38
JournalCombinatorics Probability and Computing
Issue number4
StatePublished - Jul 2011


Dive into the research topics of 'Incidences in three dimensions and distinct distances in the plane'. Together they form a unique fingerprint.

Cite this