Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
Computational Geometry
2015-03-03 v4
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 \log^2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k denoting the number centers found by the algorithm.
Keywords
Cite
@article{arxiv.1407.0614,
title = {Covering the Boundary of a Simple Polygon with Geodesic Unit Disks},
author = {George Rabanca and Ivo Vigan},
journal= {arXiv preprint arXiv:1407.0614},
year = {2015}
}