![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/b/be/Unit_disk_graph.svg/640px-Unit_disk_graph.svg.png&w=640&q=50)
Unit disk graph
Intersection graph of unit disks in the plane / From Wikipedia, the free encyclopedia
In geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex for each disk in the family, and with an edge between two vertices whenever the corresponding vertices lie within a unit distance of each other.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/b/be/Unit_disk_graph.svg/320px-Unit_disk_graph.svg.png)
They are commonly formed from a Poisson point process, making them a simple example of a random structure.