Covering polygons is even harder

被引：0

作者：

Abrahamsen, Mikkel ^{[1
]}

机构：

[1] Basic Algorithms Research Copenhagen (BARC), University of Copenhagen

来源：

arXiv | 2021年

关键词：

Convex polygon - Cover problem - Equations and inequalities - Integer coefficient - Minimum covers - NP-hard - Polynomial inequalities - Real solutions - Simple polygon - System of polynomial equations;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] HARD DRUGS AND EVEN HARDER DECISIONS
PARKER, H
BRITISH MEDICAL JOURNAL, 1989, 299 (6710): : 1241 - 1241
[22] Tough questions, even harder answers
Peter A. Ubel
Journal of General Internal Medicine, 2006, 21 : 1209 - 1210
[23] A FAST HEURISTIC FOR COVERING POLYGONS BY RECTANGLES
LEVCOPOULOS, C
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 269 - 278
[24] COVERING POLYGONS WITH MINIMUM NUMBER OF RECTANGLES
LEVCOPOULOS, C
LINGAS, A
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 166 : 63 - 72
[25] Note on covering monotone orthogonal polygons with star-shaped polygons
Lingas, Andrzej
Wasylewicz, Agnieszka
Zylinski, Pawel
INFORMATION PROCESSING LETTERS, 2007, 104 (06) : 220 - 227
[26] Let the“East Wind” Blow Even Harder
Wang Zukang
中国经贸, 1998, (01) : 94 - 94
[27] Now we must work even harder
Schloendorff, Detlef
KIDNEY INTERNATIONAL, 2012, 81 (11) : 1049 - 1050
[28] Characterizing and covering some subclasses of orthogonal polygons
Martins, Ana Mafalda
Bajuelos, Antonio Leslie
COMPUTATIONAL SCIENCE - ICCS 2006, PT 2, PROCEEDINGS, 2006, 3992 : 255 - 262
[29] Covering Convex Polygons by Two Congruent Disks
Choi, Jongmin
Jeong, Dahye
Ahn, Hee-Kap
COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 165 - 178
[30] COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
Liou, W. T.
Tang, C. Y.
Lee, R. C. T.
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1991, 1 (02) : 137 - 185

← 1 2 3 4 5 →