The \(k\) most frequent distances in the plane

DOI10.1007/s00454-002-2896-zzbMath1018.52014OpenAlexW2136361847MaRDI QIDQ1864121

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

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2896-z

zbMATH Keywords

concentric circlesnumber of incidences

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (5)

The crossing number of locally twisted cubes \(L T Q_n\) ⋮ A bipartite strengthening of the crossing Lemma ⋮ Crossing numbers of imbalanced graphs ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ On finding maximum-cardinality symmetric subsets

This page was built for publication: The \(k\) most frequent distances in the plane