Tight bounds on a problem of lines and intersections

Micha Sharir, Steven S. Skiena

Research output: Contribution to journalArticlepeer-review


Consider all arrangements of lines in the plane with r distinct slopes. What is the smallest number of lines f(r) in which there are at least f(r) + 1 points, each defined by the intersection of r lines? We improve the previous lower bound, showing f(r) = Θ(r3).

Original languageEnglish
Pages (from-to)313-314
Number of pages2
JournalDiscrete Mathematics
Issue number3
StatePublished - 1 Jun 1991


Dive into the research topics of 'Tight bounds on a problem of lines and intersections'. Together they form a unique fingerprint.

Cite this