Sciweavers

Share
COMPGEOM
2004
ACM

On distinct distances from a vertex of a convex polygon

9 years 9 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . The best previous bound, n/3 , from 1952, is due to Leo Moser. Categories and Subject Descriptors G.2.1 [Discrete Mathematics]: Combinatorics—Counting problems General Terms Theory Keywords Distinct distances, convex polygons
Adrian Dumitrescu
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where COMPGEOM
Authors Adrian Dumitrescu
Comments (0)
books