Construct · 1 fields · 1 citations

Erdős distinct distances problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Erdős distinctdistances problem1 CONSTRUCTErdős distinct distancesERDOS · COMPUTATIONAL GEOMETRY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational geometry

the question of the least number of distinct distances determined by n points in the plane, conjectured to be nearly linear in n.

In computational geometry, Erdős distinct distances problem refers to the question of the least number of distinct distances determined by n points in the plane, conjectured to be nearly linear in n. This meaning comes from Erdos (1946) in The American Mathematical Monthly.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Erdős distinct distances problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

number3 fields · 6 citationsjingle · one word, three constructsplane1 fields · 1 citationsanchor · a standalone construct

References

  1. Erdos, P. (1946). On Sets of Distances of n Points. The American Mathematical Monthly, 53(5), 248. https://doi.org/10.2307/2305092

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct