An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
Computational Geometry
2025-06-10 v1
Abstract
We prove that the single-source shortest-path problem on disk graphs can be solved in time, and that it can be solved on intersection graphs of fat triangles in time.
Keywords
Cite
@article{arxiv.2506.07571,
title = {An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs},
author = {Mark de Berg and Sergio Cabello},
journal= {arXiv preprint arXiv:2506.07571},
year = {2025}
}
Comments
19 pages, 8 figures