Distinct Distances in Graph Drawings

Paz Carmi, Vida Dujmović, Pat Morin +1

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-…