Blowing up convex sets in the plane

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)
1 Downloads (Pure)


Let K be a convex set in 2 such that every line in 2 meets . We prove that for , and that this bound is best possible, thus solving a problem of Kannan and Lovász.
Original languageEnglish
Pages (from-to)121-128
JournalLinear Algebra and Its Applications
Publication statusPublished - 1990


Dive into the research topics of 'Blowing up convex sets in the plane'. Together they form a unique fingerprint.

Cite this