On the diameter of separated point sets with many nearly equal distances
From MaRDI portal
Publication:850083
DOI10.1016/j.ejc.2006.05.007zbMath1107.52011OpenAlexW2033584738MaRDI QIDQ850083
Radoš Radoičić, Jan Vondrák, János Pach
Publication date: 15 November 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/129250
Related Items (1)
Cites Work
- Combinatorial complexity bounds for arrangements of curves and spheres
- Partitioning complete bipartite graphs by monochromatic cycles
- Cutting circles into pseudo-segments and improved bounds for incidences
- Nearly equal distances and Szemerédi's regularity lemma
- Crossing patterns of semi-algebraic sets
- Research Problems in Discrete Geometry
- Nearly Equal Distances in the Plane
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On Sets of Distances of n Points
- Distinct distances in the plane
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the diameter of separated point sets with many nearly equal distances
