Covering and piercing disks with two centers

Handle URI:
http://hdl.handle.net/10754/562693
Title:
Covering and piercing disks with two centers
Authors:
Ahn, Heekap; Kim, Sangsub; Knauer, Christian; Schlipf, Lena; Shin, Chansu; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
Abstract:
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. © 2012 Elsevier B.V.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program; Geometric Algorithms Group
Publisher:
Elsevier
Journal:
Computational Geometry: Theory and Applications
Issue Date:
Apr-2013
DOI:
10.1016/j.comgeo.2012.09.002
ARXIV:
arXiv:1201.1198
Type:
Article
ISSN:
09257721
Sponsors:
Work 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).
Additional Links:
http://arxiv.org/abs/arXiv:1201.1198v1
Appears in Collections:
Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAhn, Heekapen
dc.contributor.authorKim, Sangsuben
dc.contributor.authorKnauer, Christianen
dc.contributor.authorSchlipf, Lenaen
dc.contributor.authorShin, Chansuen
dc.contributor.authorVigneron, Antoine E.en
dc.date.accessioned2015-08-03T11:01:46Zen
dc.date.available2015-08-03T11:01:46Zen
dc.date.issued2013-04en
dc.identifier.issn09257721en
dc.identifier.doi10.1016/j.comgeo.2012.09.002en
dc.identifier.urihttp://hdl.handle.net/10754/562693en
dc.description.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.en
dc.description.sponsorshipWork 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).en
dc.publisherElsevieren
dc.relation.urlhttp://arxiv.org/abs/arXiv:1201.1198v1en
dc.subjectCoveringen
dc.subjectDisksen
dc.subjectPiercingen
dc.subjectTwo-centeren
dc.titleCovering and piercing disks with two centersen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentGeometric Algorithms Groupen
dc.identifier.journalComputational Geometry: Theory and Applicationsen
dc.contributor.institutionDepartment of Computer Science and Engineering, POSTECH, Pohang, South Koreaen
dc.contributor.institutionInstitute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germanyen
dc.contributor.institutionInstitute of Computer Science, Freie Universität Berlin, Germanyen
dc.contributor.institutionDepartment of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, South Koreaen
dc.identifier.arxividarXiv:1201.1198en
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.