Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
Abstract
We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n 2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k denoting the number centers found by the algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.