Computing shortest paths amid non-overlapping weighted disks
Computational Geometry
2024-09-16 v1
Abstract
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of non-overlapping weighted disks in the plane. For a given parameter , the length of the approximate path is at most 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.
Cite
@article{arxiv.2409.08869,
title = {Computing shortest paths amid non-overlapping weighted disks},
author = {Prosenjit Bose and Jean-Lou De Carufel and Guillermo Esteban and Anil Maheshwari},
journal= {arXiv preprint arXiv:2409.08869},
year = {2024}
}