BATCHED DYNAMIC SOLUTIONS TO DECOMPOSABLE SEARCHING PROBLEMS

被引：31
作者：
EDELSBRUNNER, H
OVERMARS, MH
机构：
[1] GRAZ TECH UNIV,INST INFORMAT PROC,A-8010 GRAZ,AUSTRIA
[2] UNIV UTRECHT,DEPT COMP SCI,3508 TA UTRECHT,NETHERLANDS
来源：
JOURNAL OF ALGORITHMS | 1985年 / 6卷 / 04期
关键词：
D O I：
10.1016/0196-6774(85)90030-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：515 / 542
页数：28
相关论文
共 21 条
[1]  
BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133
[2]  
BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628
[3]   DECOMPOSABLE SEARCHING PROBLEMS [J].
BENTLEY, JL .
INFORMATION PROCESSING LETTERS, 1979, 8 (05) :244-251
[4]   POLYGONAL INTERSECTION SEARCHING [J].
EDELSBRUNNER, H ;
MAURER, HA ;
KIRKPATRICK, DG .
INFORMATION PROCESSING LETTERS, 1982, 14 (02) :74-79
[5]   ON THE EQUIVALENCE OF SOME RECTANGLE PROBLEMS [J].
EDELSBRUNNER, H ;
OVERMARS, MH .
INFORMATION PROCESSING LETTERS, 1982, 14 (03) :124-127
[6]   ON THE INTERSECTION OF ORTHOGONAL OBJECTS [J].
EDELSBRUNNER, H ;
MAURER, HA .
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) :177-181
[7]  
EDELSBRUNNER H, 1980, F59 TU I INF REP
[8]   OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J].
KIRKPATRICK, D .
SIAM JOURNAL ON COMPUTING, 1983, 12 (01) :28-35
[9]   FINDING INTERSECTION OF RECTANGLES BY RANGE SEARCH [J].
LEE, DT ;
WONG, CK .
JOURNAL OF ALGORITHMS, 1981, 2 (04) :337-347
[10]   AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEM [J].
LEE, DT ;
PREPARATA, FP .
JOURNAL OF ALGORITHMS, 1982, 3 (03) :218-224
123