Distinct Distances on Algebraic Curves in the Plane
János Pach, Frank de Zeeuw · Combinatorics Probability Computing · 2016
LetSbe a set ofnpoints in ${\mathbb R}^{2}$ contained in an algebraic curveCof degreed. We prove that the number of distinct distances determined bySis at leastcdn4/3, unlessCcontains a line or a circle. We also prove the lower boundcd′ min{m2/3n2/3,m2,n2} for the number of distinct distances betweenmpoints on one irreducible plane algebraic curve andnpoints on another, unless the two curves are parallel lines, orthogonal lines, or concentric circles. This generalizes a result on distances between lines of Sharir, Sheffer and Solymosi in [19].