We show that for m points and n lines in R2, the number of distinct distances between the points and the lines is Ω(m1/5n3/5), as long as m1/2 ≤ n ≤ m2. We also show that for any m points in the plane, not all on a line, the number of distances between these points and the lines that they span is Ω(m4/3). We reduce the problem of bounding the number of distinct point-line distances to the problem of bounding the number of tangent pairs among a finite set of lines and a finite set of circles in the plane. We believe that this latter question is of independent interest. We also show that n circles in the plane determine at most O(n3/2) points where two or more circles are tangent. This improves the best previously known bound of O(n3/2 log n)...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
<p>Erdős conjectured in 1946 that every $n$-point set $P$ in convex position in the plane contains a...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
Let P be a set of n points in R 2 contained in an algebraic curve C of degree d. We prove that the n...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in th...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
<p>Erdős conjectured in 1946 that every $n$-point set $P$ in convex position in the plane contains a...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
Let P be a set of n points in R 2 contained in an algebraic curve C of degree d. We prove that the n...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in th...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
AbstractLet S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
<p>Erdős conjectured in 1946 that every $n$-point set $P$ in convex position in the plane contains a...