FINDING INTERSECTION OF RECTANGLES BY RANGE SEARCH

被引：16

作者：

LEE, DT ^{[1
]}

WONG, CK ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

关键词：

D O I：

10.1016/0196-6774(81)90033-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：337 / 347

页数：11

共 16 条

[1]

BAIRD HS, 1978, J DES AUTOM FAULT, V2, P179

[2]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[3]

BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

[4]

BENTLEY JL, 1978, 16TH P ALL C COMM CO, P40

[5]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[6]

KNUTH DE, 1976, ACM SIGACT NEWS APR

[7]

Lee D. T., 1980, ACM Transactions on Database Systems, V5, P339, DOI 10.1145/320613.320618

[8]

Lueker G. S., 1978, 19th Annual Symposium on Foundations of Computer Science, P28, DOI 10.1109/SFCS.1978.1

[9]

MCCREIGHT EM, 1980, CSL809 XER PARC REP

[10]

Nievergelt J., 1973, SIAM Journal on Computing, V2, P33, DOI 10.1137/0202005