Computer Science – Computational Geometry
Scientific paper
2010-05-06
Computer Science
Computational Geometry
Scientific paper
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 \cite{GK}, as further developed by Elekes et al. \cite{EKS}, to obtain sharp bounds on the number of incidences between these helices or parabolas and points in $\reals^3$. Applying these bounds, we obtain, among several other results, the upper bound $O(s^3)$ 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\ge 3$ points of $S$ to $k$ other points of $S$ is close to $O(s^3/k^{12/7})$. One of our unresolved conjectures is that this number is $O(s^3/k^2)$, for $k\ge 2$. If true, it would imply the lower bound $\Omega(s/\log s)$ on the number of distinct distances in the plane.
Elekes György
Sharir Micha
No associations
LandOfFree
Incidences in Three Dimensions and Distinct Distances in the Plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Incidences in Three Dimensions and Distinct Distances in the Plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incidences in Three Dimensions and Distinct Distances in the Plane will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-26336