Optimal Cover of Points by Disks in a Simple Polygon
Work
Year: 2011
Type: article
Abstract: Let P be a simple polygon, and let Q be a set of points in P. We present an almost-linear time algorithm for computing a minimum cover of Q by disks that are contained in P. We then generalize the alg... more
Source: SIAM Journal on Computing
Institution Ben-Gurion University of the Negev
Cites: 32
Cited by: 10
Related to: 10
FWCI: 2.513
Citation percentile (by year/subfield): 92.57
Field: Computer Science
Domain: Physical Sciences
Open Access status: green