Covering convex polygons by two congruent disks

被引：0

作者：

Choi, Jongmin ^{[1
]}

Jeong, Dahye ^{[1
,2
]}

Ahn, Hee-Kap ^{[3
]}

机构：

[1] Pohang Univ Sci & Technol, Dept Comp Sci & Engn, Pohang, South Korea

[2] Kakao Enterprise, Seongnam, South Korea

[3] Pohang Univ Sci & Technol, Grad Sch Artificial Intelligence, Dept Comp Sci & Engn, Pohang, South Korea

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2023年 / 109卷

关键词：

Two-center problem; Covering; Convex polygon; BASE-STATION PLACEMENT; LINEAR-TIME ALGORITHM; EFFICIENT ALGORITHMS; 2-CENTER PROBLEM; BOUNDARY; BALL; SET;

D O I：

10.1016/j.comgeo.2022.101936

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an O (n log n)-time algorithm for the two-center problem for a convex polygon, where n is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem. (C) 2022 Elsevier B.V. All rights reserved.

引用

页数：14

共 50 条

[21] Covering the Edges of a Complete Geometric Graph with Convex Polygons
Pinchasi, Rom
Yerushalmi, Oren
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2023,
[22] On the Covering Densities of Quarter-Convex Disks
Kirati Sriamorn
Fei Xue
[J]. Discrete & Computational Geometry, 2015, 54 : 246 - 258
[23] The Set of Packing and Covering Densities of Convex Disks
Kuperberg, Wodzimierz
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 50 (04) : 1072 - 1084
[24] On the Covering Densities of Quarter-Convex Disks
Sriamorn, Kirati
Xue, Fei
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2015, 54 (01) : 246 - 258
[25] Packing and Covering with Centrally Symmetric Convex Disks
Dan Ismailescu
Brian Kim
[J]. Discrete & Computational Geometry, 2014, 51 : 495 - 508
[26] Packing and Covering with Centrally Symmetric Convex Disks
Ismailescu, Dan
Kim, Brian
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (02) : 495 - 508
[27] The Set of Packing and Covering Densities of Convex Disks
Włodzimierz Kuperberg
[J]. Discrete & Computational Geometry, 2013, 50 : 1072 - 1084
[28] Efficient Covering of Thin Convex Domains Using Congruent Discs
Gul, Shai
Cohen, Reuven
[J]. MATHEMATICS, 2021, 9 (23)
[29] Covering points with minimum/maximum area orthogonally convex polygons
Evrendilek, Cem
Genc, Burkay
Hnich, Brahim
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2016, 54 : 32 - 44
[30] AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
Aota, Hirofumi
Fukunaga, Takuro
Nagamochi, Hiroshi
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (06) : 661 - 684

← 1 2 3 4 5 →