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 edge e_uv is the Euclidean distance between u and v. Given V and a source point s in V...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Wolfgang Mulzer
2026-02-01
|
| Серии: | Computing in Geometry and Topology |
| Online-ссылка: | https://www.cgt-journal.org/index.php/cgt/article/view/69 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|