AN ALGORITHM FOR COVERING POLYGONS WITH RECTANGLES

被引：31

作者：

FRANZBLAU, DS

KLEITMAN, DJ

机构：

来源：

INFORMATION AND CONTROL | 1984年 / 63卷 / 03期

关键词：

D O I：

10.1016/S0019-9958(84)80012-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：164 / 189

页数：26

共 22 条

[1]

AIGNER M, 1979, COMBINATORIAL THEORY, pCH6

[2] COVERING REGIONS WITH SQUARES [J].

ALBERTSON, MO ;

OKEEFE, CJ .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (03) :240-243

[3] COMBINATORIAL PROPERTIES OF POLYOMINOES [J].

BERGE, C ;

CHEN, CC ;

CHVATAL, V ;

SEOW, CS .

COMBINATORICA, 1981, 1 (03) :217-224

[4] COVERING REGIONS BY RECTANGLES [J].

CHAIKEN, S ;

KLEITMAN, DJ ;

SAKS, M ;

SHEARER, J .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04) :394-410

[5]

Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233

[6]

FRANZBLAU DS, 1984, 16TH P ANN ACM S THE, P167

[7]

FRANZBLAU DS, 1985, UNPUB

[8]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[9] A MINIMAX THEOREM ON INTERVALS [J].

GYORI, E .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (01) :1-9

[10] ALGORITHMS FOR COVERING POLYGONS BY RECTANGLES [J].

HEGEDUS, A .

COMPUTER-AIDED DESIGN, 1982, 14 (05) :257-260

← 1 2 3 →