An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
Let $V$ be a set of $n$ points in the plane. The unit-disk graph $G = (V, E)$ has vertex set $V$ and an edge $e_{uv} \in E$ between vertices $u, v \in V$ if the Euclidean distance between $u$ and $v$ is at most 1. The weight of each …