KAUST DepartmentVisual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Geometric Algorithms Group
Preprint Posting Date2012-01-05
Permanent link to this recordhttp://hdl.handle.net/10754/562693
MetadataShow full item record
AbstractWe 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. © 2012 Elsevier B.V.
CitationAhn, H.-K., Kim, S.-S., Knauer, C., Schlipf, L., Shin, C.-S., & Vigneron, A. (2013). Covering and piercing disks with two centers. Computational Geometry, 46(3), 253–262. doi:10.1016/j.comgeo.2012.09.002
SponsorsWork by Ahn was supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2010-0009857). Work by Schlipf was supported by the German Science Foundation (DFG) within the research training group 'Methods for Discrete Structures' (GRK 1408). Work by Shin was supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2011-0002827).