Distinct Distances Between a Circle and a Generic Set
Abstract
Let S be a set of points in R2 contained in a circle and P an unrestricted point set in R2. We prove the number of distinct distances between points in S and points in P is at least (|S||P|1/4-,|S|2/3|P|2/3,|S|2,|P|2). This builds on work of Pach and De Zeeuw, Bruner and Sharir, McLaughlin and Omar and Mathialagan on distances between pairs of sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.