Distinct Distances Between a Circle and a Generic Set
From MaRDI portal
(Redirected from Publication:4991650)
Abstract: Let be a set of points in contained in a circle and an unrestricted point set in . We prove the number of distinct distances between points in and points in is at least . This builds on work of Pach and De Zeeuw, Bruner and Sharir, McLaughlin and Omar and Mathialagan on distances between pairs of sets.
Recommendations
- On distinct distances between a variety and a point set
- Distinct distances on algebraic curves in the plane
- Distinct distances on non-ruled surfaces and between circles
- Circle grids and bipartite graphs of distances
- Distinct distances between points and lines
- Nearly Equal Distances in the Plane
- Distinct distances between a collinear set and an arbitrary set of points
- A product inequality for extreme distances
- Few distinct distances implies no heavy lines or circles
- Distinct Distances on Algebraic Curves in the Plane
Cites work
- A combinatorial problem on polynomials and rational functions
- A note on the number of distinct distances
- Additive combinatorics
- Cutting algebraic curves into pseudo-segments and applications
- Distinct distances between a collinear set and an arbitrary set of points
- Distinct Distances on Algebraic Curves in the Plane
- Distinct distances on two lines
- Extensions of a result of Elekes and Rónyai
- scientific article; zbMATH DE number 953255 (Why is no real title available?)
- scientific article; zbMATH DE number 803199 (Why is no real title available?)
- On Sets of Distances of n Points
- On the Erdős distinct distances problem in the plane
- Research Problems in Discrete Geometry
- The Erdős distance problem
Cited in
(4)
This page was built for publication: Distinct Distances Between a Circle and a Generic Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991650)