COVERING PLANE BY INCONGRUENT DISKS

被引：2

作者：

BLIND, G ^{[1
]}

机构：

[1] UNIV STUTTGART,MATH INST B,PFAFFENWALDRING 57,D-7 STUTTGART 80,FED REP GER

来源：

关键词：

D O I：

10.1007/BF01213954

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：179 / 194

页数：16

共 50 条

[31] Packing and Covering with Centrally Symmetric Convex Disks
Dan Ismailescu
Brian Kim
[J]. Discrete & Computational Geometry, 2014, 51 : 495 - 508
[32] Packing and Covering with Centrally Symmetric Convex Disks
Ismailescu, Dan
Kim, Brian
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (02) : 495 - 508
[33] Covering Convex Polygons by Two Congruent Disks
Choi, Jongmin
Jeong, Dahye
Ahn, Hee-Kap
[J]. COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 165 - 178
[34] Covering convex polygons by two congruent disks
Choi, Jongmin
Jeong, Dahye
Ahn, Hee-Kap
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023, 109
[35] The Set of Packing and Covering Densities of Convex Disks
Włodzimierz Kuperberg
[J]. Discrete & Computational Geometry, 2013, 50 : 1072 - 1084
[36] Covering points by unit disks of fixed location
Carmi, Paz
Katz, Matthew J.
Lev-Tov, Nissan
[J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 644 - +
[37] Covering Many or Few Points with Unit Disks
Mark de Berg
Sergio Cabello
Sariel Har-Peled
[J]. Theory of Computing Systems, 2009, 45
[38] Covering many or few points with unit disks
de Berg, Mark
Cabello, Sergio
Har-Peled, Sariel
[J]. APPROXIMATION AND ONLINE ALGORITHMS, 2006, 4368 : 55 - 68
[39] A COVERING PROBLEM FOR PLANE LATTICES
VASSALLO, S
[J]. GEOMETRIAE DEDICATA, 1992, 43 (03) : 321 - 335
[40] COVERING THE PLANE WITH CONVEX POLYGONS
PACH, J
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (01) : 73 - 81