TY - GEN
T1 - Incidences in three dimensions and distinct distances in the plane
AU - Elekes, György
AU - Sharir, Micha
PY - 2010
Y1 - 2010
N2 - 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 setup, 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 et al. [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(s 3/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/log s) on the number of distinct distances in the plane.
AB - 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 setup, 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 et al. [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(s 3/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/log s) on the number of distinct distances in the plane.
KW - Algebraic tecniques
KW - Distinct distances
KW - Incidences
UR - http://www.scopus.com/inward/record.url?scp=77954894522&partnerID=8YFLogxK
U2 - 10.1145/1810959.1811028
DO - 10.1145/1810959.1811028
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77954894522
SN - 9781450300162
T3 - Proceedings of the Annual Symposium on Computational Geometry
SP - 413
EP - 422
BT - Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10
PB - Association for Computing Machinery
T2 - 26th Annual Symposium on Computational Geometry, SoCG 2010
Y2 - 13 June 2010 through 16 June 2010
ER -