Unit distance problem

HOW IT IS BUILT The methods behind it Paul Erdős Combinatorial geometry WHAT IT CAN DO Its core abilities — — — — WHERE IT IS USED — · — — · — UDP learns · reasons · acts
How it's built
What it can do
Where it's used

The unit distance problem is a fascinating question in discrete geometry that asks: what is the maximum number of points you can place in a plane such that all pairwise distances between them equal exactly one unit? In other words, if you have a set of points and every pair of points is exactly the same distance apa…

Read the in-depth article →