EFFICIENT DATA-STRUCTURES FOR RANGE SEARCHING ON A GRID

被引：48

作者：

OVERMARS, MH ^{[1
]}

机构：

[1] STATE UNIV UTRECHT,DEPT COMP SCI,UTRECHT,NETHERLANDS

来源：

JOURNAL OF ALGORITHMS | 1988年 / 9卷 / 02期

关键词：

D O I：

10.1016/0196-6774(88)90041-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：254 / 275

页数：22

共 26 条

[1]

BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[2]

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

[3] EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING [J].

BENTLEY, JL ;

MAURER, HA .

ACTA INFORMATICA, 1980, 13 (02) :155-168

[4] FILTERING SEARCH - A NEW APPROACH TO QUERY-ANSWERING [J].

CHAZELLE, B .

SIAM JOURNAL ON COMPUTING, 1986, 15 (03) :703-724

[5]

Chazelle B., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P87, DOI 10.1109/SFCS.1986.29

[6]

EDELSBRUNNER H, 1981, B EATCS, V15, P34

[7]

EDELSBRUNNER H, 1982, F93 TU I INF PROC TE

[8] STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME [J].

FREDMAN, ML ;

KOMLOS, J ;

SZEMEREDI, E .

JOURNAL OF THE ACM, 1984, 31 (03) :538-544

[9] A LOG LOG N DATA STRUCTURE FOR 3-SIDED RANGE QUERIES [J].

FRIES, O ;

MEHLHORN, K ;

NAHER, S ;

TSAKALIDIS, A .

INFORMATION PROCESSING LETTERS, 1987, 25 (04) :269-273

[10]

KARLSSON RG, 1984, CS8450 U WAT DEP COM

← 1 2 3 →