SPACE SEARCHING FOR INTERSECTING OBJECTS

被引:31
作者
DOBKIN, DP
EDELSBRUNNER, H
机构
[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
[2] GRAZ TECH UNIV,INST INFORMAT PROC,A-8010 GRAZ,AUSTRIA
关键词
D O I
10.1016/0196-6774(87)90015-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:348 / 361
页数:14
相关论文
共 11 条
[1]  
BAYER R., 1972, ACTA INFORM, V1, P173, DOI [DOI 10.1007/BF00288683, 10.1007/BF00288683]
[2]   DECOMPOSABLE SEARCHING PROBLEMS [J].
BENTLEY, JL .
INFORMATION PROCESSING LETTERS, 1979, 8 (05) :244-251
[3]  
BROWN KQ, 1980, CMUCS80101 CARN MELL
[4]  
Chazelle B. M., 1983, CS8316 BROWN U DEP C
[5]  
COLE RD, COMMUNICATION
[6]   POLYGONAL INTERSECTION SEARCHING [J].
EDELSBRUNNER, H ;
MAURER, HA ;
KIRKPATRICK, DG .
INFORMATION PROCESSING LETTERS, 1982, 14 (02) :74-79
[7]  
EDELSBRUNNER H, 1983, F111 TU GRAZ I INF P
[8]  
MEGGIDO N, IN PRESS J ALGORITHM
[9]   POLYGON RETRIEVAL [J].
WILLARD, DE .
SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :149-165
[10]  
YAO FF, IN PRESS