The k most frequent distances in the plane

József Solymosi, G. Tardos, Csaba D. Tóth

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is fn(k) = O(n1.4571k.6286) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.

Original languageEnglish
Pages (from-to)639-648
Number of pages10
JournalDiscrete & Computational Geometry
Volume28
Issue number4
DOIs
Publication statusPublished - 2002

Fingerprint

Concentric
Incidence
Circle
Upper bound
Family

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology

Cite this

The k most frequent distances in the plane. / Solymosi, József; Tardos, G.; Tóth, Csaba D.

In: Discrete & Computational Geometry, Vol. 28, No. 4, 2002, p. 639-648.

Research output: Contribution to journalArticle

Solymosi, József ; Tardos, G. ; Tóth, Csaba D. / The k most frequent distances in the plane. In: Discrete & Computational Geometry. 2002 ; Vol. 28, No. 4. pp. 639-648.
@article{0e660c738dd94897923f76bfc1666525,
title = "The k most frequent distances in the plane",
abstract = "A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is fn(k) = O(n1.4571k.6286) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.",
author = "J{\'o}zsef Solymosi and G. Tardos and T{\'o}th, {Csaba D.}",
year = "2002",
doi = "10.1007/s00454-002-2896-z",
language = "English",
volume = "28",
pages = "639--648",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "4",

}

TY - JOUR

T1 - The k most frequent distances in the plane

AU - Solymosi, József

AU - Tardos, G.

AU - Tóth, Csaba D.

PY - 2002

Y1 - 2002

N2 - A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is fn(k) = O(n1.4571k.6286) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.

AB - A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is fn(k) = O(n1.4571k.6286) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.

UR - http://www.scopus.com/inward/record.url?scp=0036883299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036883299&partnerID=8YFLogxK

U2 - 10.1007/s00454-002-2896-z

DO - 10.1007/s00454-002-2896-z

M3 - Article

AN - SCOPUS:0036883299

VL - 28

SP - 639

EP - 648

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 4

ER -