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 条

[1] Covering Polygons is Even Harder
Abrahamsen, Mikkel
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 375 - 386
[2] COVERING OF POLYGONS BY RECTANGLES
CHENG, F
LIN, IM
COMPUTER-AIDED DESIGN, 1989, 21 (02) : 97 - 101
[3] Covering Polygons with Rectangles
Glueck, Roland
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2017), 2017, 10185 : 273 - 287
[4] COVERING POLYGONS IS HARD
CULBERSON, JC
RECKHOW, RA
JOURNAL OF ALGORITHMS, 1994, 17 (01) : 2 - 44
[5] ON COVERING ORTHOGONAL POLYGONS WITH STAR-SHAPED POLYGONS
GEWALI, L
KEIL, M
NTAFOS, S
INFORMATION SCIENCES, 1992, 65 (1-2) : 45 - 63
[6] WITH AN ESOP, THEY TRY EVEN HARDER
RITTER, A
RENDERO, T
PERSONNEL, 1990, 67 (01) : 6 - 6
[7] AN ALGORITHM FOR COVERING POLYGONS WITH RECTANGLES
FRANZBLAU, DS
KLEITMAN, DJ
INFORMATION AND CONTROL, 1984, 63 (03): : 164 - 189
[8] COVERING RECTILINEAR POLYGONS BY RECTANGLES
WU, SY
SAHNI, S
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (04) : 377 - 388
[9] ALGORITHMS FOR COVERING POLYGONS BY RECTANGLES
HEGEDUS, A
COMPUTER-AIDED DESIGN, 1982, 14 (05) : 257 - 260
[10] Covering points with orthogonal polygons
Evrendilek, Cem
Genc, Burkay
Hnich, Brahim
DISCRETE APPLIED MATHEMATICS, 2014, 164 : 92 - 99

← 1 2 3 4 5 →