Two Optimization Problems for Unit Disks

Sergio Cabello, Lazar Milinković

We present an implementation of a recent algorithm to compute shortest-path trees in unit disk graphs in $O(n\log n)$ worst-case time, where $n$ is the number of disks. In the mini…