Abstract
Given a set P of n points in convex position in the plane, we prove that there exists a point $p \in P$ such that the number of distinct distances from p is at least $\lceil (13n-6)/36 \rceil.$ The best previous bound, $\lceil n/3 \rceil,$ from 1952, is due to Moser.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
