COMPUTING THE LARGEST EMPTY RECTANGLE

被引：69

作者：

CHAZELLE, B

DRYSDALE, RL

LEE, DT

机构：

[1] DARTMOUTH COLL,DEPT MATH & COMP SCI,HANOVER,NH 03755

[2] NORTHWESTERN UNIV,DEPT ELECT ENGN COMP SCI,EVANSTON,IL 60201

来源：

关键词：

D O I：

10.1137/0215022

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：300 / 315

页数：16

共 15 条

[1] BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628
[2] BENTLEY JL, 1976, THESIS U N CAR CHAP
[3] BOYCE J, 1982, P 14 ANN S THEOR COM, P282
[4] CHAZELLE BM, 1984, UNPUB 25TH P IEEE S
[5] DOBKIN DP, UNPUB ADV COMPUTING
[6] DYNAMIC VORONOI DIAGRAMS
GOWDA, IG
KIRKPATRICK, DG
LEE, DT
NAAMAD, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) : 724 - 731
[7] O(N LOG N) ALGORITHM FOR RECTILINEAR MINIMAL SPANNING TREES
HWANG, FK
[J]. JOURNAL OF THE ACM, 1979, 26 (02) : 177 - 182
[8] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS
KIRKPATRICK, D
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 28 - 35
[9] Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[10] 2-DIMENSIONAL VORONOI DIAGRAMS IN THE LP-METRIC
LEE, DT
[J]. JOURNAL OF THE ACM, 1980, 27 (04) : 604 - 618