Sign in
Back
Covering and piercing disks with two centers
Journal article   Open access  Peer reviewed

Covering and piercing disks with two centers

Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin and Antoine Vigneron
Computational geometry : theory and applications, Vol.46(3), pp.253-262
01/04/2013
DOI: https://doi.org/10.1016/j.comgeo.2012.09.002

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
We give exact and approximation algorithms for two-center problems when the input is a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in D intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks. (C) 2012 Elsevier B.V. All rights reserved.
url
https://doi.org/10.1016/j.comgeo.2012.09.002View
Published (Version of record) Open

Metrics

3 Record Views

Details