Sets with few distinct distances do not have heavy lines

Orit E. Raz*, Oliver Roche-Newton, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


Let P be a set of n points in the plane that determines at most n/5 distinct distances. We show that no line can contain more than O(n43/52polylog(n)) points of P. We also show a similar result for rectangular distances, equivalent to distances in the Minkowski plane, where the distance between a pair of points is the area of the axis-parallel rectangle that they span.

Original languageAmerican English
Pages (from-to)1484-1492
Number of pages9
JournalDiscrete Mathematics
Issue number8
StatePublished - 6 Aug 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2015 Elsevier B.V.


  • Distinct distances
  • Incidences


Dive into the research topics of 'Sets with few distinct distances do not have heavy lines'. Together they form a unique fingerprint.

Cite this