Computing shortest paths amid non-overlapping weighted disks

In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $n$ non-overlapping weighted disks in the plane. For a given parameter $\epsilon \in (0,1]$, the length of the approximate path is at most $(1+\epsilon )$ times larger than the length of the actual shortest path. The algorithm is based on the discretization of the space by placing points on the boundary of the disks. Using such a discretization we can use Dijkstra’s algorithm for computing a shortest path in the geometric graph obtained in (pseudo-)polynomial time.