An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs

We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n{\log }^{2}n)$ time.