On distinct distances from a vertex of a convex polygon
Adrian Dumitrescu · 2004
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.